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
A simple unpredictable pseudo random number generator
SIAM Journal on Computing
A hard-core predicate for all one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Complexity and security of distributed protocols
Complexity and security of distributed protocols
Proceedings of the 4th ACM conference on Computer and communications security
ACM Transactions on Computer Systems (TOCS)
Efficient oblivious transfer protocols
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Foundations of Cryptography: Basic Tools
Foundations of Cryptography: Basic Tools
Gradual and Verifiable Release of a Secret
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Cryptographic Computation: Secure Faut-Tolerant Protocols and the Public-Key Model
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
Pricing via Processing or Combatting Junk Mail
CRYPTO '92 Proceedings of the 12th 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
The Power of RSA Inversion Oracles and the Security of Chaum's RSA-Based Blind Signature Scheme
FC '01 Proceedings of the 5th International Conference on Financial Cryptography
Time-lock Puzzles and Timed-release Crypto
Time-lock Puzzles and Timed-release Crypto
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
Multiparty computation with faulty majority
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Timed release of standard digital signatures
FC'02 Proceedings of the 6th international conference on Financial cryptography
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
On achieving the "best of both worlds" in secure multiparty computation
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Fairplay—a secure two-party computation system
SSYM'04 Proceedings of the 13th conference on USENIX Security Symposium - Volume 13
Transforming semi-honest protocols to ensure accountability
Data & Knowledge Engineering
Complete fairness in secure two-party computation
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Games for exchanging information
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Revisiting the Efficiency of Malicious Two-Party Computation
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Efficient Two-Party Secure Computation on Committed Inputs
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Secure Two-Party Computation of Squared Euclidean Distances in the Presence of Malicious Adversaries
Information Security and Cryptology
Fairness with an Honest Minority and a Rational Majority
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Unconditionally Secure Blind Authentication Codes: The Model, Constructions, and Links to Commitment
Formal to Practical Security
Fair Threshold Decryption with Semi-Trusted Third Parties
ACISP '09 Proceedings of the 14th Australasian Conference on Information Security and Privacy
Efficient two party and multi party computation against covert adversaries
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
An efficient protocol for fair secure two-party computation
CT-RSA'08 Proceedings of the 2008 The Cryptopgraphers' Track at the RSA conference on Topics in cryptology
Legally-enforceable fairness in secure two-party computation
CT-RSA'08 Proceedings of the 2008 The Cryptopgraphers' Track at the RSA conference on Topics in cryptology
Cryptography and game theory: designing protocols for exchanging information
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Fair threshold decryption with semi-trusted third parties
International Journal of Applied Cryptography
k-out-of-n oblivious transfer based on homomorphic encryption and solvability of linear equations
Proceedings of the first ACM conference on Data and application security and privacy
1/p-Secure multiparty computation without honest majority and the best of both worlds
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Complete Fairness in Secure Two-Party Computation
Journal of the ACM (JACM)
Fairness and correctness in case of a premature abort
INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India
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
On complete primitives for fairness
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
The marriage proposals problem: fair and efficient solution for two-party computations
INDOCRYPT'04 Proceedings of the 5th international conference on Cryptology in India
Rational secret sharing with semi-rational players
International Journal of Grid and Utility Computing
Partial fairness in secure two-party computation
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Efficiency tradeoffs for malicious two-party computation
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
Resource fairness and composability of cryptographic protocols
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Privacy preserving ECG quality evaluation
Proceedings of the on Multimedia and security
Salus: a system for server-aided secure function evaluation
Proceedings of the 2012 ACM conference on Computer and communications security
Efficient committed oblivious transfer of bit strings
ISC'07 Proceedings of the 10th international conference on Information Security
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 demonstrate a transformation of Yao's protocol for secure two-party computation to a fair protocol in which neither party gains any substantial advantage by terminating the protocol prematurely. The transformation adds additional steps before and after the execution of the original protocol, but does not change it otherwise, and does not use a trusted third party. It is based on the use of gradual release timed commitments, which are a new variant of timed commitments, and on a novel use of blind signatures for verifying that the committed values are correct.