Unconditionally Secure Blind Authentication Codes: The Model, Constructions, and Links to Commitment
From MaRDI portal
Publication:3631374
Recommendations
Cites work
- scientific article; zbMATH DE number 1676650 (Why is no real title available?)
- scientific article; zbMATH DE number 1722675 (Why is no real title available?)
- scientific article; zbMATH DE number 1303137 (Why is no real title available?)
- scientific article; zbMATH DE number 1088232 (Why is no real title available?)
- scientific article; zbMATH DE number 2009950 (Why is no real title available?)
- scientific article; zbMATH DE number 1759331 (Why is no real title available?)
- scientific article; zbMATH DE number 2086723 (Why is no real title available?)
- scientific article; zbMATH DE number 2088331 (Why is no real title available?)
- scientific article; zbMATH DE number 1406776 (Why is no real title available?)
- A Cartesian product construction for unconditionally secure authentication codes that permit arbitration
- A2-code = Affine resolvable + BIBD
- Commitment and authentication systems
- Communication Theory of Secrecy Systems*
- Constructions and bounds for unconditionally secure non-interactive commitment schemes
- Further results on asymmetric authentication schemes
- Group Signatures
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Security arguments for digital signatures and blind signatures
- Security in Communication Networks
- The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme
- Theory of Cryptography
- Unconditionally Secure Anonymous Encryption and Group Authentication
- Unconditionally secure blind signatures
This page was built for publication: Unconditionally Secure Blind Authentication Codes: The Model, Constructions, and Links to Commitment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3631374)