Zero-knowledge simulation of Boolean circuits
Proceedings on Advances in cryptology---CRYPTO '86
More efficient match-making and satisfiability: the five card trick
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
Adaptive Security for Threshold Cryptosystems
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference 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
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
Fair Computation of General Functions in Presence of Immoral Majority
CRYPTO '90 Proceedings of the 10th 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
Mix and Match: Secure Function Evaluation via Ciphertexts
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Weakly Secret Bit Commitment: Applications to Lotteries and Fair Exchange
CSFW '98 Proceedings of the 11th IEEE workshop on Computer Security Foundations
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
Security proofs for signature schemes
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Secure distributed key generation for discrete-log based cryptosystems
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Timed release of standard digital signatures
FC'02 Proceedings of the 6th international conference on Financial cryptography
Fair secure two-party computation
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
| Hi-index | 0.00 |
In this paper we will present a fair and efficient solution to The Marriage Proposals Problem (i.e. two-party computation of AND). This solution uses many similar ideas with the solution to The Socialist Millionaires’ Problem of [6] (we deal here with AND instead of EQUALITY and this introduces some practical small changes). Then we generalize our algorithm in three directions : first, to compute the AND with many players (not only two). Second, to compute any binary operators (boolean function of two inputs). In all these solutions we do not use Mix and Match techniques [20] but direct solutions based on the Diffie-Hellman assumption (whereas the solution of The Socialist Millionaires’ Problem of [6], as Mix and Match techniques, requires the Decision Diffie-Hellman assumption). Moreover, with our solutions we have to compute less exponentiations compared with Mix and Match techniques (50 + 4k instead of 78 + 4k or 96 + 4k, where k is the security parameter i.e. security is in 1/2k, we reduce the overall security to the Diffie-Hellman problem is difficult). Third, we will explain how to have a fair computation of any boolean function with any number of inputs (i.e. any number of players) by using Mix and Match techniques (here we will explain how to extend the scheme of [20] for fair computations).