How to prove yourself: practical solutions to identification and signature problems
Proceedings on Advances in cryptology---CRYPTO '86
Zero-knowledge proofs of identity
Journal of Cryptology
Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Some optimal inapproximability results
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
The random oracle methodology, revisited (preliminary version)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Small generic hardcore subsets for the discrete logarithm: short secret DL-keys
Information Processing Letters
Provably Secure Partially Blind Signatures
CRYPTO '00 Proceedings of the 20th 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
Wallet Databases with Observers
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Algorithms for Black-Box Fields and their Application to Cryptography (Extended Abstract)
CRYPTO '96 Proceedings of the 16th 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
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
Security of Signed ElGamal Encryption
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
A Note on Security Proofs in the Generic Model
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
The Composite Discrete Logarithm and Secure Authentication
PKC '00 Proceedings of the Third International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Security proofs for signature schemes
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Lower bounds for discrete logarithms and related problems
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
A Generalized Birthday Problem
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Enabling Privacy Protection in E-commerce Applications
WELCOM '01 Proceedings of the Second International Workshop on Electronic Commerce
ID-Based Blind Signature and Ring Signature from Pairings
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
A new design of efficient partially blind signature scheme
Journal of Systems and Software
Linkability Analysis of Some Blind Signature Schemes
Computational Intelligence and Security
One-Round ID-Based Blind Signature Scheme without ROS Assumption
Pairing '08 Proceedings of the 2nd international conference on Pairing-Based Cryptography
Enhancing the security of perfect blind DL-signatures
Information Sciences: an International Journal
Efficient ID-based blind signature and proxy signature from bilinear pairings
ACISP'03 Proceedings of the 8th Australasian conference on Information security and privacy
Efficient partially blind signatures with provable security
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part III
Two improved partially blind signature schemes from bilinear pairings
ACISP'05 Proceedings of the 10th Australasian conference on Information Security and Privacy
Efficient identity-based signatures and blind signatures
CANS'05 Proceedings of the 4th international conference on Cryptology and Network Security
Efficient partially blind signature scheme with provable security
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Linkability of a blind signature scheme and its improved scheme
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part IV
Fast and proven secure blind identity-based signcryption from pairings
CT-RSA'05 Proceedings of the 2005 international conference on Topics in Cryptology
A machine-checked formalization of the random oracle model
TYPES'04 Proceedings of the 2004 international conference on Types for Proofs and Programs
Machine-checked security proofs of cryptographic signature schemes
ESORICS'05 Proceedings of the 10th European conference on Research in Computer Security
Blind spontaneous anonymous group signatures for ad hoc groups
ESAS'04 Proceedings of the First European conference on Security in Ad-hoc and Sensor Networks
Efficient partially blind signatures with provable security
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
Efficient blind and partially blind signatures without random oracles
TCC'06 Proceedings of the Third conference on Theory of Cryptography
An efficient static blind ring signature scheme
ICISC'05 Proceedings of the 8th international conference on Information Security and Cryptology
| Hi-index | 0.00 |
We present a novel parallel one-more signature forgery against blind Okamoto-Schnorr and blind Schnorr signatures in which an attacker interacts some l times with a legitimate signer and produces from these interactions l + 1 signatures. Security against the new attack requires that the following ROS-problem is intractable: find an overdetermined, solvable system of linear equations modulo q with random inhomogenities (right sides).There is an inherent weakness in the security result of POINTCHEVAL AND STERN. Theorem 26[PS00] does not cover attacks with 4 parallel interactions for elliptic curves of order 2200. That would require the intractability of the ROS-problem, a plausible but novel complexity assumption. Conversely, assuming the intractability of the ROS-problem, we show that Schnorr signatures are secure in the random oracle and generic group model against the one-more signature forgery.