Efficient oblivious transfer protocols
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Rethinking Public Key Infrastructures and Digital Certificates: Building in Privacy
Rethinking Public Key Infrastructures and Digital Certificates: Building in Privacy
Concurrent Zero Knowledge with Logarithmic Round-Complexity
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
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
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
Bounded-concurrent secure two-party computation without setup assumptions
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
SIAM Journal on Computing
Simulatable Adaptive Oblivious Transfer
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Efficient attributes for anonymous credentials
Proceedings of the 15th ACM conference on Computer and communications security
Security of Blind Signatures under Aborts
Irvine Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09
A Framework for Universally Composable Non-committing Blind Signatures
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Concurrently-secure blind signatures without random oracles or setup assumptions
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Universally-composable two-party computation in two rounds
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Equivocal blind signatures and adaptive UC-security
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Structure-preserving signatures and commitments to group elements
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Impossibility of blind signatures from one-way permutations
TCC'11 Proceedings of the 8th conference on Theory of cryptography
Limits of provable security from standard assumptions
Proceedings of the forty-third annual ACM symposium on Theory of computing
On the (im)possibility of blind message authentication codes
CT-RSA'06 Proceedings of the 2006 The Cryptographers' Track at the RSA conference on Topics in Cryptology
Efficient blind signatures without random oracles
SCN'04 Proceedings of the 4th international conference on Security in Communication Networks
On the impossibility of three-move blind signature schemes
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Concurrent blind signatures without random oracles
SCN'06 Proceedings of the 5th international conference on Security and Cryptography for Networks
Round-optimal composable blind signatures in the common reference string model
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Efficient blind and partially blind signatures without random oracles
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Round-Optimal privacy-preserving protocols with smooth projective hash functions
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Beyond the limitation of prime-order bilinear groups, and round optimal blind signatures
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Security of blind signatures revisited
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
Efficient two-move blind signatures in the common reference string model
ISC'12 Proceedings of the 15th international conference on Information Security
Compact round-optimal partially-blind signatures
SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security
Non-black-box simulation in the fully concurrent setting
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Journal of Computer Security - Advances in Security for Communication Networks
| Hi-index | 0.00 |
Constructing round-optimal blind signatures in the standard model has been a long standing open problem. In particular, Fischlin and Schröder recently ruled out a large class of three-move blind signatures in the standard model (Eurocrypt'10). In particular, their result shows that finding security proofs for the well-known blind signature schemes by Chaum, and by Pointcheval and Stern in the standard model via black-box reductions is hard. In this work we propose the first roundoptimal, i.e., two-move, blind signature scheme in the standard model (i.e., without assuming random oracles or the existence of a common reference string). Our scheme relies on the Decisional Diffie Hellman assumption and the existence of sub-exponentially hard 1-to-1 one way functions. This scheme is also secure in the concurrent setting.