Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs
From MaRDI portal
Publication:901372
DOI10.1007/s00145-014-9184-yzbMath1332.94066OpenAlexW2046763185WikidataQ122928188 ScholiaQ122928188MaRDI QIDQ901372
Publication date: 11 January 2016
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://discovery.ucl.ac.uk/id/eprint/1474844/
secure function evaluationfully homomorphic encryptionminimizing communicationhybrid encryptionnon-interactive zero-knowledge proofs
Related Items
Multimodal private signatures, Triply adaptive UC NIZK, Efficient NIZKs from LWE via polynomial reconstruction and ``MPC in the head, Succinct interactive oracle proofs: applications and limitations, Succinct publicly-certifiable proofs. Or, can a blockchain verify a designated-verifier proof?, Continuously non-malleable codes against bounded-depth tampering, Two-round maliciously secure computation with super-polynomial simulation, Multi-theorem preprocessing NIZKs from lattices, Compact designated verifier NIZKs from the CDH assumption without pairings, Compact NIZKs from standard assumptions on bilinear maps, Adaptively secure MPC with sublinear communication complexity, Breaking the Circuit Size Barrier for Secure Computation Under DDH, Zero-knowledge proofs for committed symmetric Boolean functions
Cites Work
- On the complexity of interactive proofs with bounded communication
- Definitions and properties of zero-knowledge proof systems
- An efficient noninteractive zero-knowledge proof system for NP with general assumptions
- On interactive proofs with a laconic prover
- (Leveled) fully homomorphic encryption without bootstrapping
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Short Non-interactive Zero-Knowledge Proofs
- Faster Fully Homomorphic Encryption
- Interactive PCP
- Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes
- Fully Homomorphic Encryption over the Integers
- Zero-Knowledge Proofs from Secure Multiparty Computation
- i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits
- Compact Group Signatures Without Random Oracles
- Cryptography in the Multi-string Model
- A Pseudorandom Generator from any One-way Function
- Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
- Nonmalleable Cryptography
- On the Composition of Zero-Knowledge Proof Systems
- Packed Ciphertexts in LWE-Based Homomorphic Encryption
- Fully homomorphic encryption using ideal lattices
- Communication preserving protocols for secure function evaluation
- New Techniques for Noninteractive Zero-Knowledge
- Ring Signatures of Sub-linear Size Without Random Oracles
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
