A randomized protocol for signing contracts
Communications of the ACM
Zero-knowledge proofs of identity
Journal of Cryptology
Pseudo-random generation from one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
A hard-core predicate for all one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Pseudo-random generators under uniform assumptions
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Bit commitment using pseudo-randomness (extended abstract)
CRYPTO '89 Proceedings on Advances in cryptology
Controlled gradual disclosure schemes for random bits and their applications
CRYPTO '89 Proceedings on Advances in cryptology
Gradual and Verifiable Release of a Secret
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques 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
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
A large-scale contents publishing architecture based on reliable multicast
SIGDOC '97 Proceedings of the 15th annual international conference on Computer documentation
An efficient protocol for anonymous and fair document exchange
Computer Networks: The International Journal of Computer and Telecommunications Networking
Evolution of Fair Non-repudiation with TTP
ACISP '99 Proceedings of the 4th Australasian Conference on Information Security and Privacy
Fair Exchange of Digital Signatures with Offline Trusted Third Party
ICICS '01 Proceedings of the Third International Conference on Information and Communications Security
Mechanical Proofs about a Non-repudiation Protocol
TPHOLs '01 Proceedings of the 14th International Conference on Theorem Proving in Higher Order Logics
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
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
Revised Papers from the 9th International Workshop on Security Protocols
Fair certified e-mail delivery
Proceedings of the 2004 ACM symposium on Applied computing
A unified approach to a fair document exchange system
Journal of Systems and Software
ACM SIGOPS Operating Systems Review
An optimistic fair exchange protocol and its security in the universal composability framework
International Journal of Applied Cryptography
Dandelion: cooperative content distribution with robust incentives
ATC'07 2007 USENIX Annual Technical Conference on Proceedings of the USENIX Annual Technical Conference
Certified E-Mail Protocol in the ID-Based Setting
ACNS '07 Proceedings of the 5th international conference on Applied Cryptography and Network Security
A fair non-repudiation protocol
SP'96 Proceedings of the 1996 IEEE conference on Security and privacy
An agent-mediated fair exchange protocol
ICICS'10 Proceedings of the 12th international conference on Information and communications security
Contract signature in e-commerce
Computers and Electrical Engineering
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 |
The simultaneous secret exchange protocol is the key tool for contract signing protocols and certified mail protocols. This paper proposes efficient simultaneous secret exchange protocols (or gradual secret releasing protocols) that are based on general assumptions such as the existence of one-way permutations and one-way functions, while the existing efficient simultaneous secret exchange protocols are based on more constrained assumptions such as specific number theoretic problems and the existence of oblivious transfer primitives (or trap-door one-way permutations). Moreover, while the existing simultaneous secret exchange protocols have an additional requirement that the underlying commit (encryption) function is “ideal”, the above-mentioned “general assumptions” are provably sufficient for our schemes. Therefore, our protocols are provably secure under the general assumptions. In addition, our protocols are at least as efficient as the existing practical protocols, when efficient one-way permutations and one-way functions are used.