A randomized protocol for signing contracts
Communications of the ACM
Demonstrating possession of a discrete logarithm without revealing it
Proceedings on Advances in cryptology---CRYPTO '86
All-or-nothing disclosure of secrets
Proceedings on Advances in cryptology---CRYPTO '86
Oblivious transfer and polynomial evaluation
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Efficient oblivious transfer protocols
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
ACISP '02 Proceedings of the 7th Australian Conference on Information Security and Privacy
Minimal Complete Primitives for Secure Multi-party Computation
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Multiparty Computation from Threshold Homomorphic Encryption
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Priced Oblivious Transfer: How to Sell Digital Goods
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
On the Security of ElGamal Based Encryption
PKC '98 Proceedings of the First International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Efficient 1-Out-n Oblivious Transfer Schemes
PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
Conditional oblivious transfer and timed-release encryption
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Public-key cryptosystems based on composite degree residuosity classes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Efficient k-out-of-n oblivious transfer schemes with adaptive and non-adaptive queries
PKC'05 Proceedings of the 8th international conference on Theory and Practice in Public Key Cryptography
An efficient solution to the millionaires' problem based on homomorphic encryption
ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
Evaluating 2-DNF formulas on ciphertexts
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
| Hi-index | 0.00 |
We introduce a new notion of conditional oblivious cast (COC), which involves three parties: a sender S and two receivers A and B. Receivers A and B own their secrets x and y, respectively, and the sender S holds the message m. In a COC scheme for the predicate Q (Q-COC), A and B send x and y in a masked form to S, and then S sends m to A and B such that they get m if and only if Q(x,y)=1. Besides, the secrets x and y can not be revealed to another receiver nor the sender. We also extend COC to 1-out-of-2 COC (COC$^{\rm 1}_{\rm 2}$) in which S holds two messages m0 and m1, and A and B get m1 if Q(x,y)=1 and m0 otherwise. We give the definitions for COC and COC$^{\rm 1}_{\rm 2}$, and propose several COC and COC$^{\rm 1}_{\rm 2}$ schemes for “equality”, “inequality”, and “greater than” predicates. These are fundamental schemes that are useful in constructing more complex secure interactive protocols. Our schemes are efficiently constructed via homomorphic encryption schemes and proved secure under the security of these encryption schemes.