Filters








4 Hits in 1.8 sec

i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits [chapter]

Craig Gentry, Shai Halevi, Vinod Vaikuntanathan
2010 Lecture Notes in Computer Science  
A multi-hop homomorphic encryption is a scheme which is i-hop for all i.  ...  First, we observe that "bootstrapping" techniques can be used to convert any (1-hop) homomorphic encryption scheme into an i-hop scheme for any i, and the result inherits the function-privacy and/or compactness  ...  Homomorphic Encryption from Yao Circuits For the sake of concreteness, we now describe the folklore construction of (1-hop) homomorphic encryption from any two-message SFE protocol, and the extension of  ... 
doi:10.1007/978-3-642-14623-7_9 fatcat:u5e3qtlsqvaehahac6i2cgbqum

Secure Computation on the Web: Computing without Simultaneous Interaction [chapter]

Shai Halevi, Yehuda Lindell, Benny Pinkas
2011 Lecture Notes in Computer Science  
All our protocols are based on standard assumptions, and we achieve security both in the semi-honest and malicious adversary models.  ...  Despite the power and generality of secure computation, its use in practice seems limited.  ...  (In contrast, in the setting of multi-Hop homomorphic encryption if party i + 1 is dishonest then the adversary can evaluatef i .)  ... 
doi:10.1007/978-3-642-22792-9_8 fatcat:b2na3m7h2rhv7c6wjo24fbjkci

Efficient and Scalable Universal Circuits

Masaud Y. Alhassan, Daniel Günther, Ágnes Kiss, Thomas Schneider
2020 Journal of Cryptology  
., for private function evaluation (PFE) and for improving the flexibility of attribute-based encryption schemes.  ...  A universal circuit (UC) can be programmed to simulate any circuit up to a given size n by specifying its program inputs.  ...  In [30] , a DDH-based multi-hop homomorphic encryption scheme is proposed that uses rerandomizable garbled circuits, for which UCs are used to achieve function privacy.  ... 
doi:10.1007/s00145-020-09346-z fatcat:54mpexqmp5fexf7orovsih4uzy

Efficient Private Function Evaluation

Ágnes Kiss
2021
PFE of Boolean circuits can also be realized using additively homomorphic encryption and standard SFE techniques.  ...  These techniques include homomorphic encryption, garbling techniques and secret sharing.  ...  This work has been co-funded by the German Federal Ministry of Education and Research (BMBF) and the Hessen State Ministry for Higher Education, Research and the Arts (HMWK) within CRISP and by the DFG  ... 
doi:10.26083/tuprints-00017496 fatcat:nvvgirlijzg6venax5znicrkeq