Conditional oblivious cast

Cheng Kang Chu*, Wen-Guey Tzeng

*Corresponding author for this work

研究成果: Conference contribution同行評審

1 引文 斯高帕斯(Scopus)

摘要

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.

原文English
主出版物標題Public Key Cryptography - PKC 2006 - 9th International Conference on Theory and Practice in Public-Key Cryptography, Proceedings
頁面443-457
頁數15
DOIs
出版狀態Published - 17 七月 2006
事件9th International Conference on Theory and Practice in Public-Key Cryptography, PKC 2006 - New York, NY, United States
持續時間: 24 四月 200626 四月 2006

出版系列

名字Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
3958 LNCS
ISSN(列印)0302-9743
ISSN(電子)1611-3349

Conference

Conference9th International Conference on Theory and Practice in Public-Key Cryptography, PKC 2006
國家United States
城市New York, NY
期間24/04/0626/04/06

指紋 深入研究「Conditional oblivious cast」主題。共同形成了獨特的指紋。

引用此