Unconditionally Secure Blind Authentication Codes: The Model, Constructions, and Links to Commitment
From MaRDI portal
Publication:3631374
DOI10.1007/978-3-642-02002-5_7zbMath1242.94036OpenAlexW1544728448MaRDI QIDQ3631374
Taiki Ishiwata, Yuki Hara, Junji Shikata, Tsutomu Matsumoto
Publication date: 9 June 2009
Published in: Formal to Practical Security (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02002-5_7
Cites Work
- 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
- The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme
- Security arguments for digital signatures and blind signatures
- Constructions and bounds for unconditionally secure non-interactive commitment schemes
- Further results on asymmetric authentication schemes
- Communication Theory of Secrecy Systems*
- Commitment and Authentication Systems
- Unconditionally Secure Blind Signatures
- Group Signatures
- A2-code = Affine resolvable + BIBD
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Unconditionally Secure Anonymous Encryption and Group Authentication
- Security in Communication Networks
- Theory of Cryptography
