Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs
From MaRDI portal
Recommendations
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- \(i\)-hop homomorphic encryption and rerandomizable Yao circuits
- A Pseudorandom Generator from any One-way Function
- An efficient noninteractive zero-knowledge proof system for NP with general assumptions
- Communication preserving protocols for secure function evaluation
- Compact Group Signatures Without Random Oracles
- Cryptography in the Multi-string Model
- Definitions and properties of zero-knowledge proof systems
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Faster fully homomorphic encryption
- Fully homomorphic encryption over the integers
- Fully homomorphic encryption using ideal lattices
- Fully homomorphic encryption with relatively small key and ciphertext sizes
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- scientific article; zbMATH DE number 5485522 (Why is no real title available?)
- scientific article; zbMATH DE number 503349 (Why is no real title available?)
- scientific article; zbMATH DE number 2019634 (Why is no real title available?)
- scientific article; zbMATH DE number 1842511 (Why is no real title available?)
- Interactive PCP
- Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
- New techniques for noninteractive zero-knowledge
- Nonmalleable Cryptography
- On interactive proofs with a laconic prover
- On the complexity of interactive proofs with bounded communication
- On the Composition of Zero-Knowledge Proof Systems
- Packed ciphertexts in LWE-based homomorphic encryption
- Ring Signatures of Sub-linear Size Without Random Oracles
- Short non-interactive zero-knowledge proofs
- Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
- Zero-knowledge proofs from secure multiparty computation
Cited in
(25)- On zero-testable homomorphic encryption and publicly verifiable non-interactive arguments
- Compact designated verifier NIZKs from the CDH assumption without pairings
- Compact NIZKs from standard assumptions on bilinear maps
- Zero-knowledge proofs for committed symmetric Boolean functions
- Fully homomorphic NIZK and NIWI proofs
- Two-round maliciously secure computation with super-polynomial simulation
- Breaking the circuit size barrier for secure computation under DDH
- Theory of Cryptography
- Multi-theorem preprocessing NIZKs from lattices
- Adaptively secure MPC with sublinear communication complexity
- 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
- Compact NIZKs from standard assumptions on bilinear maps
- Beyond MPC-in-the-head: black-box constructions of short zero-knowledge proofs
- Rate-1 statistical non-interactive zero-knowledge
- Unique NIZKs and steganography detection
- Rate-1 zero-knowledge proofs from one-way functions
- Succinct computational secret sharing for monotone circuits
- Boosting SNARKs and rate-1 barrier in arguments of knowledge
- Malicious homomorphic secret sharing with applications to DV-NIZK and more
- Multi-hop multi-key homomorphic signatures with context hiding from standard assumptions
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)
