TY - GEN

T1 - Conditional oblivious cast

AU - Chu, Cheng Kang

AU - Tzeng, Wen-Guey

PY - 2006/7/17

Y1 - 2006/7/17

N2 - 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 21) in which S holds two messages m0 and m 1, and A and B get m1 if Q(x,y) = 1 and m0 otherwise. We give the definitions for COC and COC21, and propose several COC and COC21 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.

AB - 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 21) in which S holds two messages m0 and m 1, and A and B get m1 if Q(x,y) = 1 and m0 otherwise. We give the definitions for COC and COC21, and propose several COC and COC21 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.

KW - Conditional oblivious transfer

KW - Oblivious cast

KW - Secure computation

UR - http://www.scopus.com/inward/record.url?scp=33745856888&partnerID=8YFLogxK

U2 - 10.1007/11745853_29

DO - 10.1007/11745853_29

M3 - Conference contribution

AN - SCOPUS:33745856888

SN - 3540338519

SN - 9783540338512

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 443

EP - 457

BT - Public Key Cryptography - PKC 2006 - 9th International Conference on Theory and Practice in Public-Key Cryptography, Proceedings

Y2 - 24 April 2006 through 26 April 2006

ER -