Further results on asymmetric authentication schemes
From MaRDI portal
Publication:1854283
DOI10.1006/inco.1998.2767zbMath1012.94012OpenAlexW1999551705MaRDI QIDQ1854283
Publication date: 14 January 2003
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/f8c689e82ba5e2e67ea2a7a71d6f3254ed9b389d
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)
Related Items (4)
Construction of authentication codes with double arbiters over symplectic geometry ⋮ Three constructions of perfect authentication codes from projective geometry over finite fields ⋮ Multi-verifier signatures ⋮ Unconditionally Secure Blind Authentication Codes: The Model, Constructions, and Links to Commitment
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Cartesian product construction for unconditionally secure authentication codes that permit arbitration
- How to share a secret with cheaters
- Authentication codes for nontrusting parties obtained from rank metric codes
- On-line/off-line digital signatures
- Authentication Theory/Coding Theory
- Codes and information
- The Detection of Cheaters in Thershold Schemes
- Lower bounds on the probability of deception in authentication with arbitration
- Bounds on the probability of deception in multiple authentication
- Codes Which Detect Deception
- Message Authentication with Arbitration of Transmitter/Receiver Disputes
This page was built for publication: Further results on asymmetric authentication schemes