Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
New blind signatures equivalent to factorization (extended abstract)
Proceedings of the 4th ACM conference on Computer and communications security
Further results on asymmetric authentication schemes
Information and Computation
Constructions and Bounds for Unconditionally Secure Non-Interactive Commitment Schemes
Designs, Codes and Cryptography
A2-code = Affine resolvable = BIBD
ICICS '97 Proceedings of the First International Conference on Information and Communication Security
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
New Bound on Authentication Code with Arbitration
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Security of Blind Digital Signatures (Extended Abstract)
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
A Secure Three-Move Blind Signature Scheme for Polynomially Many Signatures
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Security Notions for Unconditionally Secure Signature Schemes
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Provably Secure Blind Signature Schemes
ASIACRYPT '96 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Unconditionally Secure Anonymous Encryption and Group Authentication
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
The Power of RSA Inversion Oracles and the Security of Chaum's RSA-Based Blind Signature Scheme
FC '01 Proceedings of the 5th International Conference on Financial Cryptography
A Study of Blind Message Authentication Codes
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Combinatorial bounds for authentication codes with arbitration
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
Message authentication with arbitration of transmitter/receiver disputes
EUROCRYPT'87 Proceedings of the 6th annual international conference on Theory and application of cryptographic techniques
Fair secure two-party computation
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Efficient blind signatures without random oracles
SCN'04 Proceedings of the 4th international conference on Security in Communication Networks
Efficient blind and partially blind signatures without random oracles
TCC'06 Proceedings of the Third conference on Theory of Cryptography
| Hi-index | 0.00 |
In this paper, as a fundamental cryptographic protocol with information-theoretic security, we propose an unconditionally secure blind authentication code (BA-code for short) which is an unconditionally secure authentication code with anonymity of messages. As we will see, the BA-code is a simple model of an authentication code with the function similar to that of the unconditionally secure blind signature (USBS for short). The relationship between BA-codes and USBS is similar to the one between traditional authentication codes and unconditionally secure signature schemes as well as the one between group authentication codes and group signature schemes. In addition, we provide two kinds of constructions of BA-codes: direct constructions based on polynomials over finite fields, and a generic construction by using unconditionally secure encryption and A2-codes. Furthermore, as application we show a link between BA-codes and commitment in unconditional security setting: starting from BA-codes, unconditionally secure commitment schemes can be constructed in a black-box way.