Proceedings of CRYPTO 84 on Advances in cryptology
The cryptographic security of truncated linearly related variables
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Minimum disclosure proofs of knowledge
Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
Zero-knowledge proofs of identity
Journal of Cryptology
The knowledge complexity of interactive proof systems
SIAM Journal on Computing
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
ACM Transactions on Computer Systems (TOCS)
Gradual and Verifiable Release of a Secret
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Direct Minimum-Knowledge Computations
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
A Simple and Secure Way to Show the Validity of Your Public Key
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Controlled Gradual Disclosure Schemes for Random Bits and Their Applications
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Fair Computation of General Functions in Presence of Immoral Majority
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
How to simultaneously exchange a secret bit by flipping a symmetrically-biased coin
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
Trapdoor pseudo-random number generators, with applications to protocol design
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
How to generate and exchange secrets
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Proofs that yield nothing but their validity and a methodology of cryptographic protocol design
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Random self-reducibility and zero knowledge interactive proofs of possession of information
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Collision free hash functions and public key signature schemes
EUROCRYPT'87 Proceedings of the 6th annual international conference on Theory and application of cryptographic techniques
Verifiable Partial Escrow of Integer Factors
Designs, Codes and Cryptography
Evolution of Fair Non-repudiation with TTP
ACISP '99 Proceedings of the 4th Australasian Conference on Information Security and Privacy
A Juridical Validation of a Contract Signing Protocol
EC-WEB '02 Proceedings of the Third International Conference on E-Commerce and Web Technologies
Fair Exchange of Digital Signatures with Offline Trusted Third Party
ICICS '01 Proceedings of the Third International Conference on Information and Communications Security
Verifiable Partial Sharing of Integer Fractions
SAC '98 Proceedings of the Selected Areas in Cryptography
SAC '01 Revised Papers from the 8th Annual International Workshop on Selected Areas in Cryptography
Separability and Efficiency for Generic Group Signature Schemes
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
An Efficient Divisible Electronic Cash Scheme
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
Efficient Fair Exchange with Verifiable Confirmation of Signatures
ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Signing Contracts and Paying Electronically
Lectures on Data Security, Modern Cryptology in Theory and Practice, Summer School, Aarhus, Denmark, July 1998
An Efficient Protocol for Certified Electronic Mail
ISW '00 Proceedings of the Third International Workshop on Information Security
Efficient Optimistic N-Party Contract Signing Protocol
ISC '01 Proceedings of the 4th International Conference on Information Security
A Realistic Protocol for Multi-party Certified Electronic Mail
ISC '02 Proceedings of the 5th International Conference on Information Security
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
A fair non-repudiation protocol
SP'96 Proceedings of the 1996 IEEE conference on Security and privacy
One-time trapdoor one-way functions
ISC'10 Proceedings of the 13th international conference on Information security
Contract signature in e-commerce
Computers and Electrical Engineering
Stand-Alone and setup-free verifiably committed signatures
CT-RSA'06 Proceedings of the 2006 The Cryptographers' Track at the RSA conference on Topics in Cryptology
More on stand-alone and setup-free verifiably committed signatures
ACISP'06 Proceedings of the 11th Australasian conference on Information Security and Privacy
Improved anonymous timed-release encryption
ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security
Secure peer-to-peer trading for multiplayer games
Proceedings of the 11th Annual Workshop on Network and Systems Support for Games
| Hi-index | 0.00 |
We present a protocol that allows a sender to gradually and verifiably release a secret to a receiver. We argue that the protocol can be efficiently applied to exchange secrets in many cases, for example when the secret is a digital signature. This includes Rabin, low-public-exponent RSA, and El Gamal signatures. In these cases, the protocol requires an interactive 3-pass initial phase, after which each bit (or block of bits) of the signature can be released non-interactively (i.e. by sending 1 message). The necessary computations can be done in a few seconds on an up-to-date PC. The protocol is statistical zero-knowledge, and therefore releases a negligible amount of side information in the Shannon sense to the receiver. The sender is unable to cheat, if he cannot factor a large composite number before the protocol is completed.We also point out a simple method by which any type of signatures can be applied to fair contract signing using only one signature.