Full metadata record
DC FieldValueLanguage
dc.contributor.authorChu, Cheng-Kangen_US
dc.contributor.authorTzeng, Wen-Gueyen_US
dc.date.accessioned2014-12-08T15:17:39Z-
dc.date.available2014-12-08T15:17:39Z-
dc.date.issued2006en_US
dc.identifier.isbn3-540-33851-9en_US
dc.identifier.issn0302-9743en_US
dc.identifier.urihttp://hdl.handle.net/11536/12805-
dc.description.abstractWe 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(2)/(1)) in which S holds two messages m(0) and m(1), and A and B get m(1) if Q(x, y) = 1 and m(0) otherwise. We give the definitions for COC and COC(2)/(1), and propose several COC and COC(2)/(1) 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.en_US
dc.language.isoen_USen_US
dc.subjectoblivious casten_US
dc.subjectconditional oblivious transferen_US
dc.subjectsecure computationen_US
dc.titleConditional oblivious casten_US
dc.typeArticle; Proceedings Paperen_US
dc.identifier.journalPUBLIC KEY CRYPTOGRAPHY - PKC 2006, PROCEEDINGSen_US
dc.citation.volume3958en_US
dc.citation.spage443en_US
dc.citation.epage457en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000238186800029-
Appears in Collections:Conferences Paper