How to prove yourself: practical solutions to identification and signature problems
Proceedings on Advances in cryptology---CRYPTO '86
A digital signature scheme secure against adaptive chosen-message attacks
SIAM Journal on Computing - Special issue on cryptography
Minimum disclosure proofs of knowledge
Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
Zero-knowledge proofs of identity
Journal of Cryptology
Universal one-way hash functions and their cryptographic applications
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Witness indistinguishable and witness hiding protocols
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Fast signature generation with a Fiat Shamir—like scheme
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
New blind signatures equivalent to factorization (extended abstract)
Proceedings of the 4th ACM conference on Computer and communications security
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
SIAM Journal on Computing
Efficient Non-malleable Commitment Schemes
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
A Modification of the Fiat-Shamir Scheme
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Security of 2^t-Root Identification and Signatures
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
Efficient and Non-interactive Non-malleable Commitment
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Identification Protocols Secure against Reset Attacks
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
On Defining Proofs of Knowledge
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Rapid demonstration of linear relations connected by boolean operators
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Chameleon hashes without key exposure based on factoring
Journal of Computer Science and Technology
Improved Non-committing Encryption with Applications to Adaptively Secure Protocols
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Signature Schemes with Bounded Leakage Resilience
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Comments and improvements on key-exposure free chameleon hashing based on factoring
Inscrypt'10 Proceedings of the 6th international conference on Information security and cryptology
Paillier's cryptosystem modulo p2q and its applications to trapdoor commitment schemes
Mycrypt'05 Proceedings of the 1st international conference on Progress in Cryptology in Malaysia
Revised fischlin’s (blind) signature schemes
CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part II
Completely non-malleable schemes
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Concurrent non-malleable statistically hiding commitment
Information Processing Letters
| Hi-index | 0.00 |
We review the representation problem based on factoring and show that this problem gives rise to alternative solutions to a lot of cryptographic protocols in the literature. And, while the solutions so far usually either rely on the RSA problem or the intractability of factoring integers of a special form (e.g., Blum integers), the solutions here work with the most general factoring assumption. Protocols we discuss include identification schemes secure against parallel attacks, secure signatures, blind signatures and (non-malleable) commitments.