A digital signature scheme secure against adaptive chosen-message attacks
SIAM Journal on Computing - Special issue on cryptography
Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
Practical and provably secure release of a secret and exchange of signatures
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Optimistic protocols for fair exchange
Proceedings of the 4th ACM conference on Computer and communications security
Signature schemes based on the strong RSA assumption
CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
ACISP '97 Proceedings of the Second Australasian Conference on Information Security and Privacy
A Fair Protocol for Signing Contracts (Extended Abstract)
Proceedings of the 12th Colloquium on Automata, Languages and Programming
An Efficient Verifiable Encryption Scheme for Encryption of Discrete Logarithms
CARDIS '98 Proceedings of the The International Conference on Smart Card Research and Applications
Abuse-Free Optimistic Contract Signing
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Convertible Undeniable Signatures
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Off-Line Fair Payment Protocols Using Convertible Signatures
ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Client/Server Tradeoffs for Online Elections
PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
Simple and fast optimistic protocols for fair electronic exchange
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Constructing fair-exchange protocols for E-commerce via distributed computation of RSA signatures
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Breaking and repairing optimistic fair exchange from PODC 2003
Proceedings of the 3rd ACM workshop on Digital rights management
Publicly verifiable secret sharing
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Public-key cryptosystems based on composite degree residuosity classes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Efficient proofs that a committed number lies in an interval
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Aggregate and verifiably encrypted signatures from bilinear maps
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Ambiguous Optimistic Fair Exchange
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Security Analysis of Zhu-Bao's Verifiably Committed Signature
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Efficient Fair Exchange from Identity-Based Signature
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Optimistic fair exchange in a multi-user setting
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
Multi-party stand-alone and setup-free verifiably committed signatures
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
CT-RSA'08 Proceedings of the 2008 The Cryptopgraphers' Track at the RSA conference on Topics in cryptology
Fair exchange protocol of Schnorr signatures with semi-trusted adjudicator
Computers and Electrical Engineering
One-time trapdoor one-way functions
ISC'10 Proceedings of the 13th international conference on Information security
Group-oriented fair exchange of signatures
Information Sciences: an International Journal
Non-black-box computation of linear regression protocols with malicious adversaries
ISPEC'11 Proceedings of the 7th international conference on Information security practice and experience
Further observations on optimistic fair exchange protocols in the multi-user setting
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
More on stand-alone and setup-free verifiably committed signatures
ACISP'06 Proceedings of the 11th Australasian conference on Information Security and Privacy
| Hi-index | 0.00 |
In this paper, a novel construction of stand-alone and setup-free verifiably committed signatures from RSA – an open problem advertised by Dodis and Reyzin in their speech [16] is presented. The methodology used in this paper is reminiscent of the concept of verifiably encrypted signatures introduced by Asokan et al [1, 2] . We suggest to encrypt only a random salt used to generate a virtual commitment that will be embedded into Cramer-Shoup’s signature scheme and to prove the validity of the signature with respect to this encrypted value. Our construction is provably secure assuming that the underlying Cramer-Shoup’s signature scheme is secure against adaptive chosen-message attack, and Paillier’s encryption is one-way. We thus provide an efficient solution to Dodis-Reyzin’s open problem.