i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits
From MaRDI portal
Publication:3582753
DOI10.1007/978-3-642-14623-7_9zbMath1280.94061OpenAlexW1515370218MaRDI QIDQ3582753
Shai Halevi, Vinod Vaikuntanathan, Craig Gentry
Publication date: 24 August 2010
Published in: Advances in Cryptology – CRYPTO 2010 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-14623-7_9
Related Items (30)
Pushing the limits of Valiant's universal circuits: simpler, tighter and more compact ⋮ Succinct garbling schemes from functional encryption through a local simulation paradigm ⋮ A Lattice-Based Approach to Privacy-Preserving Biometric Authentication Without Relying on Trusted Third Parties ⋮ 3-Message Zero Knowledge Against Human Ignorance ⋮ Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity ⋮ Multi-key FHE from LWE, Revisited ⋮ Asymptotically quasi-optimal cryptography ⋮ Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles ⋮ Efficient and scalable universal circuits ⋮ Reactive Garbling: Foundation, Instantiation, Application ⋮ Unidirectional updatable encryption and proxy re-encryption from DDH ⋮ SCALES. MPC with small clients and larger ephemeral servers ⋮ Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs ⋮ Rate-1 quantum fully homomorphic encryption ⋮ Benaloh’s Dense Probabilistic Encryption Revisited ⋮ Feasibility and Infeasibility of Adaptively Secure Fully Homomorphic Encryption ⋮ Circuit-Private Multi-key FHE ⋮ Candidate iO from homomorphic encryption schemes ⋮ (Leveled) Fully Homomorphic Encryption without Bootstrapping ⋮ Candidate iO from homomorphic encryption schemes ⋮ Witness indistinguishability for any single-round argument with applications to access control ⋮ Generalized Learning Problems and Applications to Non-commutative Cryptography ⋮ FHE Circuit Privacy Almost for Free ⋮ Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption ⋮ On the Existence of Extractable One-Way Functions ⋮ Spooky Encryption and Its Applications ⋮ On Constructing Homomorphic Encryption Schemes from Coding Theory ⋮ Lattice-Based Fully Dynamic Multi-key FHE with Short Ciphertexts ⋮ Garbled Circuits as Randomized Encodings of Functions: a Primer ⋮ Homomorphic Encryption
This page was built for publication: i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits
