On the public citation graph

A cartesian product construction for unconditionally secure authentication codes that permit arbitration

https://doi.org/10.1007/bf00204449

0 signed · 81 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/3-540-39118-5_15openalex-snapshot

Message Authentication with Arbitration of Transmitter/Receiver Disputes

inferredcites →https://doi.org/10.1007/3-540-39568-7_32openalex-snapshot

Authentication Theory/Coding Theory

inferredcites →https://doi.org/10.1007/3-540-45961-8_5openalex-snapshot

Authentication Codes with Multiple Arbiters

inferredcites →https://doi.org/10.1007/3-540-45961-8_6openalex-snapshot

Some Constructions for Authentication - Secrecy Codes

inferredcites →https://doi.org/10.1007/3-540-46885-4_43openalex-snapshot

How easy is collision search? Application to DES

inferredcites →https://doi.org/10.1007/3-540-47721-7_30openalex-snapshot

Some Constructions and Bounds for Authentication Codes

inferredcites →https://doi.org/10.1007/3-540-48184-2_25openalex-snapshot

A Natural Taxonomy for Digital Information Authentication Schemes

inferredcites →https://doi.org/10.1007/bf02351720openalex-snapshot

A construction for authentication/secrecy codes from certain combinatorial designs

inferredcites →https://doi.org/10.1080/0161-118491858737openalex-snapshot

A SYSTEM FOR VERIFYING USER IDENTITY AND AUTHORIZATION AT THE POINT-OF SALE OR ACCESS

inferredcites →https://doi.org/10.1109/49.17706openalex-snapshot

A protocol to provide verifiable proof of identity and unforgeable transaction receipts

inferredcites →https://doi.org/10.1109/tit.1980.1056264openalex-snapshot

A modification of the RSA public-key encryption procedure (Corresp.)

inferredcites →https://doi.org/10.1109/tit.1985.1057074openalex-snapshot

A public key cryptosystem and a signature scheme based on discrete logarithms

inferredcites →https://doi.org/10.1137/0217017openalex-snapshot

A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks

inferredcites →https://doi.org/10.1145/357980.358017openalex-snapshot

A method for obtaining digital signatures and public-key cryptosystems

inferredcites →https://doi.org/10.1145/359340.359342openalex-snapshot

A method for obtaining digital signatures and public-key cryptosystems

inferredcites →https://doi.org/10.2140/pjm.1963.13.421openalex-snapshot

Finite nets. II. Uniqueness and imbedding

inferredcites →https://doi.org/10.2172/6448547openalex-snapshot

Secure stand alone positive personnel identity verification system (SSA-PPIV)

inferredcites →https://doi.org/10.4153/cjm-1951-012-7openalex-snapshot

Finite Nets, I. Numerical Invariants

What points at this work

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

inferred← citeshttps://doi.org/10.1002/0471219282.eot365openalex-snapshot

Authentication Codes

inferred← citeshttps://doi.org/10.1006/inco.1998.2767openalex-snapshot

Further Results on Asymmetric Authentication Schemes

inferred← citeshttps://doi.org/10.1007/10958513_33openalex-snapshot

The Role of Arbiters in Asymmetric Authentication Schemes

inferred← citeshttps://doi.org/10.1007/3-540-36178-2_4openalex-snapshot

Bounds for Robust Metering Schemes and Their Relationship with A2-code

inferred← citeshttps://doi.org/10.1007/3-540-38424-3_13openalex-snapshot

Arbitrated Unconditionally Secure Authentication Can Be Unconditionally Protected against Arbiter’s Attacks

inferred← citeshttps://doi.org/10.1007/3-540-44448-3_11openalex-snapshot

Unconditionally Secure Digital Signature Schemes Admitting Transferability

inferred← citeshttps://doi.org/10.1007/3-540-44987-6_27openalex-snapshot

Lower Bounds for Multicast Message Authentication

inferred← citeshttps://doi.org/10.1007/3-540-45664-3_5openalex-snapshot

Efficient and Unconditionally Secure Digital Signatures and a Security Analysis of a Multireceiver Authentication Code

inferred← citeshttps://doi.org/10.1007/3-540-45961-8_5openalex-snapshot

Authentication Codes with Multiple Arbiters

inferred← citeshttps://doi.org/10.1007/3-540-46035-7_29openalex-snapshot

Security Notions for Unconditionally Secure Signature Schemes

inferred← citeshttps://doi.org/10.1007/3-540-48329-2_29openalex-snapshot

On the Construction of Perfect Authentication Codes that Permit Arbitration

inferred← citeshttps://doi.org/10.1007/3-540-48658-5_16openalex-snapshot

New Bound on Authentication Code with Arbitration

inferred← citeshttps://doi.org/10.1007/3-540-48970-3_25openalex-snapshot

Characterization of Optimal Authentication Codes with Arbitration

inferred← citeshttps://doi.org/10.1007/3-540-49264-x_23openalex-snapshot

Combinatorial Bounds for Authentication Codes with Arbitration

inferred← citeshttps://doi.org/10.1007/3-540-49264-x_25openalex-snapshot

A2—codes from universal hash classes

inferred← citeshttps://doi.org/10.1007/3-540-57220-1_49openalex-snapshot

Practical proven secure authentication with arbitration

inferred← citeshttps://doi.org/10.1007/978-1-4419-1385-2_8openalex-snapshot

Source Coding under Secrecy Constraints

inferred← citeshttps://doi.org/10.1007/978-1-4615-0229-6openalex-snapshot

Secure Broadcast Communication

inferred← citeshttps://doi.org/10.1007/978-3-540-24632-9_17openalex-snapshot

General Group Authentication Codes and Their Relation to “Unconditionally-Secure Signatures”

inferred← citeshttps://doi.org/10.1007/978-3-540-30556-9_13openalex-snapshot

Symmetric Authentication Codes with Secrecy and Unconditionally Secure Authenticated Encryption

inferred← citeshttps://doi.org/10.1007/978-3-540-48000-6_31openalex-snapshot

A 3-Codes under Collusion Attacks

inferred← citeshttps://doi.org/10.1007/978-3-642-02002-5_7openalex-snapshot

Unconditionally Secure Blind Authentication Codes: The Model, Constructions, and Links to Commitment

inferred← citeshttps://doi.org/10.1007/978-3-642-20728-0_10openalex-snapshot

Unconditionally Secure Signature Schemes Revisited

inferred← citeshttps://doi.org/10.1007/bf00125202openalex-snapshot

Construction of Cartesian authentication codes from unitary geometry

inferred← citeshttps://doi.org/10.1007/bf00196910openalex-snapshot

New bounds and constructions for authentication/secrecy codes with splitting

inferred← citeshttps://doi.org/10.1007/bf01388475openalex-snapshot

Authentication codes for nontrusting parties obtained from rank metric codes

inferred← citeshttps://doi.org/10.1007/bfb0023284openalex-snapshot

Non-repudiation without public-key

inferred← citeshttps://doi.org/10.1007/bfb0028468openalex-snapshot

A2-code = Affine resolvable + BIBD

inferred← citeshttps://doi.org/10.1007/bfb0030427openalex-snapshot

Arbitrated unconditionally secure authentication scheme with multi-senders

inferred← citeshttps://doi.org/10.1007/bfb0030844openalex-snapshot

New bound for affine resolvable designs and its application to authentication codes

inferred← citeshttps://doi.org/10.1007/bfb0053440openalex-snapshot

Near optimal unconditionally secure authentication

inferred← citeshttps://doi.org/10.1007/bfb0053463openalex-snapshot

On A2-codes including arbiter's attacks

inferred← citeshttps://doi.org/10.1007/s10440-008-9346-8openalex-snapshot

Further Results on the Existence of Splitting BIBDs and Application to Authentication Codes

inferred← citeshttps://doi.org/10.1007/s10623-005-1501-xopenalex-snapshot

A New Class of Optimal 3-splitting Authentication Codes

inferred← citeshttps://doi.org/10.1007/s10623-006-0021-7openalex-snapshot

GOB designs for authentication codes with arbitration

inferred← citeshttps://doi.org/10.1007/s10623-007-9104-3openalex-snapshot

A new class of optimal 3-splitting authentication codes

inferred← citeshttps://doi.org/10.1007/s12095-010-0020-4openalex-snapshot

Combinatorial bounds and characterizations of splitting authentication codes

inferred← citeshttps://doi.org/10.1007/s12095-015-0179-9openalex-snapshot

Some new classes of 2-fold optimal or perfect splitting authentication codes

inferred← citeshttps://doi.org/10.1007/s12204-008-0482-0openalex-snapshot

On the existence of (υ, 3 × 3, λ)-splitting balanced incomplete block design with λ between 2 to 9

inferred← citeshttps://doi.org/10.1016/j.amc.2014.12.088openalex-snapshot

Three constructions of perfect authentication codes from projective geometry over finite fields

inferred← citeshttps://doi.org/10.1016/s0012-365x(03)00283-8openalex-snapshot

New combinatorial designs and their applications to authentication codes and secret sharing schemes

inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00011-8openalex-snapshot

Arbitrated unconditionally secure authentication scheme with multi-senders

inferred← citeshttps://doi.org/10.1016/s1005-8885(17)60191-2openalex-snapshot

Construction of authentication codes with distrust arbitration from polynomials over finite fields

inferred← citeshttps://doi.org/10.1023/a:1008326209304openalex-snapshot

Combinatorial Classification of Optimal Authentication Codes with Arbitration

inferred← citeshttps://doi.org/10.1023/a:1008398306907openalex-snapshot

Combinatorial Bounds on Authentication Codes with Arbitration

inferred← citeshttps://doi.org/10.1023/a:1016501125022openalex-snapshot

Constructions and Bounds for Unconditionally Secure Non-Interactive Commitment Schemes

inferred← citeshttps://doi.org/10.1103/physreva.77.046301openalex-snapshot

Comment on “Arbitrated quantum-signature scheme”

inferred← citeshttps://doi.org/10.1109/18.333869openalex-snapshot

Lower bounds on the probability of deception in authentication with arbitration

inferred← citeshttps://doi.org/10.1109/icc.2015.7249512openalex-snapshot

Arbitrated Secure Authentication realized by using quantum principles

inferred← citeshttps://doi.org/10.1109/isit.1993.748545openalex-snapshot

Lower Bounds on the Probability of Deception in Authentication with Arbitration

inferred← citeshttps://doi.org/10.1109/isit.1994.395107openalex-snapshot

A/sup 2/-codes and codes for the rank metric

inferred← citeshttps://doi.org/10.1109/isit.1995.550341openalex-snapshot

Constructions of asymmetric authentication systems

inferred← citeshttps://doi.org/10.1109/itwtpi.2005.1543947openalex-snapshot

Unconditionally secure signatures and its related schemes

inferred← citeshttps://doi.org/10.1137/s0895480103435469openalex-snapshot

Combinatorial Constructions for Optimal Splitting Authentication Codes

inferred← citeshttps://doi.org/10.1184/r1/6073610openalex-snapshot

The TESLA Broadcast Authentication Protocol

inferred← citeshttps://doi.org/10.1201/9781420003185.ax1openalex-snapshot

Survey of Constructions for A-Codes

inferred← citeshttps://doi.org/10.1561/0100000044openalex-snapshot

Combinatorial Designs for Authentication and Secrecy Codes

inferred← citeshttps://doi.org/10.1561/9781601983596openalex-snapshot

Combinatorial Designs for Authentication and Secrecy Codes

inferred← citeshttps://doi.org/10.1587/transfun.2022tap0015openalex-snapshot

Multi-Designated Receiver Authentication Codes: Models and Constructions

inferred← citeshttps://doi.org/10.1587/transfun.e98.a.16openalex-snapshot

Trends and Development of Information-Theoretic Cryptography

inferred← citeshttps://doi.org/10.3934/amc.2011.5.59openalex-snapshot

Infinite families of optimal splitting authentication codes secure against spoofing attacks of higher order

inferred← citeshttps://doi.org/10.70675/2be63f9cz0af5z4e60z9b28z9a002fd1a49copenalex-snapshot

Cellular automata, boolean functions and combinatorial designs

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.