Back to Blog
Autocrypt homomorphic acm5/31/2023 ![]() Freedman MJ Nissim K Pinkas B Cachin C Camenisch JL Efficient private matching and set intersection Advances in Cryptology - EUROCRYPT 2004 2004 Heidelberg Springer 1 19 10.1007/978-6-3_1 Google Scholar Cross Ref Freedman MJ Ishai Y Pinkas B Reingold O Kilian J Keyword Search and Oblivious Pseudorandom Functions Theory of Cryptography 2005 Heidelberg Springer 303 324 10.1007/978-6-7_17 Google Scholar Digital Library Damgård I Pastro V Smart N Zakarias S Safavi-Naini R Canetti R Multiparty computation from somewhat homomorphic encryption Advances in Cryptology – CRYPTO 2012 2012 Heidelberg Springer 643 662 10.1007/978-9-5_38 Google Scholar Digital Library Damgård I Keller M Larraia E Pastro V Scholl P Smart NP Crampton J Jajodia S Mayes K Practical covertly secure MPC for dishonest majority – or: breaking the SPDZ limits Computer Security – ESORICS 2013 2013 Heidelberg Springer 1 18 10.1007/978-3-6_1 Google Scholar Damgård I Jurik M Kim K A generalisation, a simplification and some applications of paillier’s probabilistic public-key system Public Key Cryptography 2001 Heidelberg Springer 119 136 10.1007/6-2_9 0987.94032 Google Scholar Cross Ref ![]() Corniaux CL Ghodosi H A verifiable 1-out-of-n distributed oblivious transfer protocol IACR Cryptol. Cianciullo L Ghodosi H Lee K Unconditionally secure distributed oblivious polynomial evaluation Information Security and Cryptology – ICISC 2018 2019 Cham Springer 132 142 10.1007/978-6-4_9 Google Scholar Chang Y-C Lu C-J Boyd C Oblivious polynomial evaluation and oblivious neural learning Advances in Cryptology - ASIACRYPT 2001 2001 Heidelberg Springer 369 384 10.1007/2-1_22 Google Scholar Blundo C D’Arco P De Santis A Stinson DR Nyberg K Heys H New results on unconditionally secure distributed oblivious transfer Selected Areas in Cryptography 2003 Heidelberg Springer 291 309 10.1007/2-7_19 1039.94006 Google Scholar Blundo C D’Arco P De Santis A Stinson D On unconditionally secure distributed oblivious transfer J. Bendlin R Damgård I Orlandi C Zakarias S Paterson KG Semi-homomorphic encryption and multiparty computation Advances in Cryptology – EUROCRYPT 2011 2011 Heidelberg Springer 169 188 10.1007/978-5-4_11 Google Scholar Cross Ref Also, the proposed protocol can be extended to a protocol of secure 1 2 distributed oblivious transfer with the linear communication complexity O( k) where the same setting of security is achieved. The communication complexity is determined by the term kt which improves the DOPE approaches of and. In addition, it preserves strong privacy conditions for a DOPE system. ![]() Our protocol holds the unconditional security against a malicious sender in the offline phase and a static active adversary corrupting a coalition of at most k - 1 dishonest servers in the online computation phase with negligible probability of error. The sender is involved in the offline phase which can be implemented at any time well in advance of the actual online computation phase. We present a verifiable and private DOPE protocol using additive homomorphic encryption in the presence of k distributed servers where k does not depend on the degree t. They communicate with a set of distributed cloud servers to implement a secure computation such that the receiver party obtains f ( x 2 ), while the privacy of their inputs is preserved. Distributed oblivious polynomial evaluation (DOPE) is a special case of two-party computation where a sender party holds a polynomial f( x) of degree t and a receiver party has an input x 2.
0 Comments
Read More
Leave a Reply. |