Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs
From MaRDI portal
Publication:901372
DOI10.1007/S00145-014-9184-YzbMATH Open1332.94066OpenAlexW2046763185WikidataQ122928188 ScholiaQ122928188MaRDI QIDQ901372FDOQ901372
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/
Recommendations
fully homomorphic encryptionsecure function evaluationminimizing communicationhybrid encryptionnon-interactive zero-knowledge proofs
Cites Work
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Faster Fully Homomorphic Encryption
- Fully Homomorphic Encryption over the Integers
- i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits
- Fully homomorphic encryption using ideal lattices
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- A Pseudorandom Generator from any One-way Function
- Nonmalleable Cryptography
- On the Composition of Zero-Knowledge Proof Systems
- (Leveled) fully homomorphic encryption without bootstrapping
- Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes
- Compact Group Signatures Without Random Oracles
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
- Definitions and properties of zero-knowledge proof systems
- On interactive proofs with a laconic prover
- On the complexity of interactive proofs with bounded communication
- Title not available (Why is that?)
- Ring Signatures of Sub-linear Size Without Random Oracles
- Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
- Title not available (Why is that?)
- Communication preserving protocols for secure function evaluation
- Cryptography in the Multi-string Model
- Interactive PCP
- Packed Ciphertexts in LWE-Based Homomorphic Encryption
- An efficient noninteractive zero-knowledge proof system for NP with general assumptions
- Zero-Knowledge Proofs from Secure Multiparty Computation
- Title not available (Why is that?)
- Title not available (Why is that?)
- New Techniques for Noninteractive Zero-Knowledge
- Short Non-interactive Zero-Knowledge Proofs
Cited In (16)
- Continuously non-malleable codes against bounded-depth tampering
- Zero-knowledge proofs for committed symmetric Boolean functions
- Beyond MPC-in-the-head: black-box constructions of short zero-knowledge proofs
- Theory of Cryptography
- Compact NIZKs from standard assumptions on bilinear maps
- Triply adaptive UC NIZK
- Succinct publicly-certifiable proofs. Or, can a blockchain verify a designated-verifier proof?
- Multimodal private signatures
- Breaking the Circuit Size Barrier for Secure Computation Under DDH
- 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
- Efficient NIZKs from LWE via polynomial reconstruction and ``MPC in the head
- Two-round maliciously secure computation with super-polynomial simulation
- Succinct interactive oracle proofs: applications and limitations
This page was built for publication: Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q901372)
