On the public citation graph

Multisender authentication systems with unconditional security

https://doi.org/10.1007/bfb0028469
0 signed · 30 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/j.1538-7305.1974.tb02751.xopenalex-snapshot
Codes Which Detect Deception
inferredcites →https://doi.org/10.1007/0-387-34799-2_3openalex-snapshot
Generalized Secret Sharing and Monotone Functions
inferredcites →https://doi.org/10.1007/3-540-44750-4_29openalex-snapshot
On General Perfect Secret Sharing Schemes
inferredcites →https://doi.org/10.1007/3-540-44750-4_3openalex-snapshot
Bucket Hashing and its Application to Fast Message Authentication
inferredcites →https://doi.org/10.1007/3-540-46885-4_45openalex-snapshot
Some Ideal Secret Sharing Schemes
inferredcites →https://doi.org/10.1007/3-540-48071-4_38openalex-snapshot
Threshold Schemes with Disenrollment
inferredcites →https://doi.org/10.1007/3-540-48285-7_1openalex-snapshot
On the Relation Between A-Codes and Codes Correcting Independent Errors
inferredcites →https://doi.org/10.1007/3-540-57332-1_12openalex-snapshot
A generalized secret sharing scheme with cheater detection
inferredcites →https://doi.org/10.1007/3-540-58265-7_5openalex-snapshot
Linear algebra approach to secret sharing schemes
inferredcites →https://doi.org/10.1007/3-540-61332-3_174openalex-snapshot
Three systems for shared generation of authenticators
inferredcites →https://doi.org/10.1007/3-540-69053-0_12openalex-snapshot
Bucket Hashing with a Small Key Size
inferredcites →https://doi.org/10.1007/bf00125203openalex-snapshot
An explication of secret sharing schemes
inferredcites →https://doi.org/10.1007/bf02252868openalex-snapshot
The combinatorics of authentication and secrecy codes
inferredcites →https://doi.org/10.1007/bf02451112openalex-snapshot
Some improved bounds on the information rate of perfect secret sharing schemes
inferredcites →https://doi.org/10.1007/bfb0053421openalex-snapshot
A linear construction of perfect secret sharing schemes
inferredcites →https://doi.org/10.1109/5.4445openalex-snapshot
A survey of information authentication
inferredcites →https://doi.org/10.1109/infcom.1992.263476openalex-snapshot
Multi-receiver/multi-sender network security: efficient authenticated multicast/feedback
inferredcites →https://doi.org/10.1137/0404044openalex-snapshot
The Detection of Cheaters in Thershold Schemes
inferredcites →https://doi.org/10.1145/359168.359176openalex-snapshot
How to share a secret

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-36552-4_17openalex-snapshot
Threshold MACs
inferred← citeshttps://doi.org/10.1007/3-540-45311-3_13openalex-snapshot
Linear Authentication Codes: Bounds and Constructions
inferred← citeshttps://doi.org/10.1007/978-3-642-40588-4_2openalex-snapshot
Information-Theoretically Secure Aggregate Authentication Code: Model, Bounds, and Constructions
inferred← citeshttps://doi.org/10.1007/bfb0053730openalex-snapshot
Bounds and constructions for A3-code with multi-senders
inferred← citeshttps://doi.org/10.1080/00207160214648openalex-snapshot
Bounds And Constructions For Threshold Shared Generation Of Authenticators
inferred← citeshttps://doi.org/10.1109/ecti-con51831.2021.9454696openalex-snapshot
Formation of the New Multi-sender Authentication Codes Via Symplectic Space through Finite Commutative Rings with Applications
inferred← citeshttps://doi.org/10.1109/tit.2003.809567openalex-snapshot
Linear authentication codes: bounds and constructions
inferred← citeshttps://doi.org/10.1145/1229285.1229310openalex-snapshot
Unconditionally secure ring authentication
inferred← citeshttps://doi.org/10.1155/2013/320392openalex-snapshot
A New Construction of Multisender Authentication Codes from Polynomials over Finite Fields
inferred← citeshttps://doi.org/10.1155/2013/602539openalex-snapshot
A New Construction of Multisender Authentication Codes from Pseudosymplectic Geometry over Finite Fields
inferred← citeshttps://doi.org/10.1587/transfun.e98.a.16openalex-snapshot
Trends and Development of Information-Theoretic Cryptography
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.