Fully homomorphic NIZK and NIWI proofs
From MaRDI portal
Publication:2175946
DOI10.1007/978-3-030-36033-7_14zbMath1455.94109OpenAlexW2989776361MaRDI QIDQ2175946
Anna Lysyanskaya, Yael Tauman Kalai, Apoorvaa Deshpande, Prabhanjan V. Ananth
Publication date: 30 April 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-36033-7_14
Cryptography (94A60) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)
Related Items (3)
Fully homomorphic NIZK and NIWI proofs ⋮ Towards accountability in CRS generation ⋮ New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust
Cites Work
- Non-interactive zero-knowledge proofs for composite statements
- Fully homomorphic NIZK and NIWI proofs
- Interactive Proofs under Continual Memory Leakage
- Malleable Proof Systems and Applications
- Leveled Fully Homomorphic Signatures from Standard Lattices
- Homomorphic Signatures for Polynomial Functions
- Randomizable Proofs and Delegatable Anonymous Credentials
- Noninteractive Zero-Knowledge
- Foundations of Cryptography
- Computationally Sound Proofs
- Succinct Malleable NIZKs and an Application to Compact Shuffles
- Foundations of Homomorphic Secret Sharing
- Fully homomorphic encryption using ideal lattices
- Zaps and Their Applications
- Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
- Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$
- Recursive composition and bootstrapping for SNARKS and proof-carrying data
- Cryptography with Updates
- Non-interactive Zaps and New Techniques for NIZK
- Multi-theorem preprocessing NIZKs from lattices
This page was built for publication: Fully homomorphic NIZK and NIWI proofs
