A randomized protocol for signing contracts
Communications of the ACM
Limits on the security of coin flips when half the processors are faulty
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
The round complexity of secure protocols
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
A minimal model for secure computation (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Linear zero-knowledge—a note on efficient zero-knowledge proofs and arguments
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Optimistic protocols for fair exchange
Proceedings of the 4th ACM conference on Computer and communications security
Gradual and Verifiable Release of a Secret
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Multiparty Computations Ensuring Privacy of Each Party's Input and Correctness of the Result
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Non-Interactive Oblivious Transfer and Spplications
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
CRYPTO '91 Proceedings of the 11th 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
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Committed Oblivious Transfer and Private Multi-Party Computation
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Efficient Group Signature Schemes for Large Groups (Extended Abstract)
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Number-theoretic constructions of efficient pseudo-random functions
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Protocols for secure computations
SFCS '82 Proceedings of the 23rd 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
Multiparty computation with faulty majority
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Publicly verifiable secret sharing
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Efficient concurrent zero-knowledge in the auxiliary string model
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Optimistic fair exchange of digital signatures
IEEE Journal on Selected Areas in Communications
A Cost-Effective Pay-Per-Multiplication Comparison Method for Millionaires
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
Efficient Two-Party Secure Computation on Committed Inputs
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Fair Threshold Decryption with Semi-Trusted Third Parties
ACISP '09 Proceedings of the 14th Australasian Conference on Information Security and Privacy
Fair threshold decryption with semi-trusted third parties
International Journal of Applied Cryptography
Probabilistic escrow of financial transactions with cumulative threshold disclosure
FC'05 Proceedings of the 9th international conference on Financial Cryptography and Data Security
Secure computations in a minimal model using multiple-valued ESOP expressions
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
On complete primitives for fairness
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
An efficient and verifiable solution to the millionaire problem
ICISC'04 Proceedings of the 7th international conference on Information Security and Cryptology
Ciphertext comparison, a new solution to the millionaire problem
ICICS'05 Proceedings of the 7th international conference on Information and Communications Security
On the feasibility of consistent computations
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Partial fairness in secure two-party computation
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
On combining privacy with guaranteed output delivery in secure multiparty computation
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Resource fairness and composability of cryptographic protocols
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Efficient cryptographic protocol design based on distributed el gamal encryption
ICISC'05 Proceedings of the 8th international conference on Information Security and Cryptology
Efficient committed oblivious transfer of bit strings
ISC'07 Proceedings of the 10th international conference on Information Security
Distributing trusted third parties
ACM SIGACT News
Fair private set intersection with a semi-trusted arbiter
DBSec'13 Proceedings of the 27th international conference on Data and Applications Security and Privacy XXVII
| Hi-index | 0.00 |
We present an efficient and fair protocol for secure two-party computation in the optimistic model, where a partially trusted third party T is available, but not involved in normal protocol executions. T is needed only if communication is disrupted or if one of the two parties misbehaves. The protocol guarantees that although one party may terminate the protocol at any time, the computation remains fair for the other party. Communication is over an asynchronous network. All our protocols are based on efficient proofs of knowledge and involve no general zero-knowledge tools. As intermediate steps we describe efficient verifiable oblivious transfer and verifiable secure function evaluation protocols, whose security is proved under the decisional Diffie-Hellman assumption.