Multi-theorem preprocessing NIZKs from lattices
From MaRDI portal
Recommendations
- Multi-theorem preprocessing NIZKs from lattices
- Designated verifier/prover and preprocessing NIZKs from Diffie-Hellman assumptions
- Towards non-interactive zero-knowledge for NP from LWE
- Toward non-interactive zero-knowledge proofs for NP from LWE
- New constructions of reusable designated-verifier NIZKs
Cites work
- A formal concept of domain pseudonymous signatures
- A Framework for Efficient and Composable Oblivious Transfer
- A Framework for Universally Composable Non-committing Blind Signatures
- Advances in Cryptology - CRYPTO 2003
- Almost Perfect Lattices, the Covering Radius Problem, and Applications to Ajtai's Connection Factor
- An efficient noninteractive zero-knowledge proof system for NP with general assumptions
- An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
- Basing non-interactive zero-knowledge on (enhanced) trapdoor permutations: the state of the art
- Bonsai trees, or how to delegate a lattice basis
- Breaking the circuit size barrier for secure computation under DDH
- Certifying trapdoor permutations, revisited
- Classical hardness of learning with errors
- Compact Proofs of Retrievability
- Computing on authenticated data
- Concurrent Blind Signatures Without Random Oracles
- Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One
- Definitions and properties of zero-knowledge proof systems
- Designated verifier/prover and preprocessing NIZKs from Diffie-Hellman assumptions
- Designated-verifier pseudorandom generators, and their applications
- Efficient designated-verifier non-interactive zero-knowledge proofs of knowledge
- Efficient lattice (H)IBE in the standard model
- Efficient network coding signatures in the standard model
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Enhancements of trapdoor permutations
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Faster Bootstrapping with Polynomial Error
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption
- Fiat-Shamir: from practice to theory
- From obfuscation to the security of Fiat-Shamir for proofs
- Fully homomorphic encryption using ideal lattices
- Fully homomorphic message authenticators
- Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
- Generalizing homomorphic MACs for arithmetic circuits
- Generating shorter bases for hard random lattices
- Hardness of SIS and LWE with small parameters
- Hash proof systems over lattices revisited
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Homomorphic network coding signatures in the standard model
- Homomorphic signatures and message authentication codes
- Homomorphic signatures for polynomial functions
- Homomorphic signatures with efficient verification for polynomial functions
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- How to use indistinguishability obfuscation
- scientific article; zbMATH DE number 1722675 (Why is no real title available?)
- scientific article; zbMATH DE number 4191111 (Why is no real title available?)
- scientific article; zbMATH DE number 3825707 (Why is no real title available?)
- scientific article; zbMATH DE number 4037759 (Why is no real title available?)
- scientific article; zbMATH DE number 4053065 (Why is no real title available?)
- scientific article; zbMATH DE number 4101089 (Why is no real title available?)
- scientific article; zbMATH DE number 176564 (Why is no real title available?)
- scientific article; zbMATH DE number 1256724 (Why is no real title available?)
- scientific article; zbMATH DE number 1256680 (Why is no real title available?)
- scientific article; zbMATH DE number 708820 (Why is no real title available?)
- scientific article; zbMATH DE number 708823 (Why is no real title available?)
- scientific article; zbMATH DE number 2009960 (Why is no real title available?)
- scientific article; zbMATH DE number 2086698 (Why is no real title available?)
- scientific article; zbMATH DE number 1842511 (Why is no real title available?)
- scientific article; zbMATH DE number 1405637 (Why is no real title available?)
- Improved security for linearly homomorphic signatures: a generic framework
- Improved zero-knowledge proofs of knowledge for the ISIS problem, and applications
- Lattice-based blind signatures
- Lattice-based FHE as secure as PKE
- Leveled fully homomorphic signatures from standard lattices
- Linearly homomorphic signatures over binary fields and new tools for lattice-based signatures
- Making Sigma-protocols non-interactive without random oracles
- Multi-key Homomorphic Authenticators
- Multi-theorem preprocessing NIZKs from lattices
- Multiparty Computation from Somewhat Homomorphic Encryption
- Multiparty computation with low communication, computation and interaction via threshold FHE
- New (and old) proof systems for lattice problems
- New constructions of reusable designated-verifier NIZKs
- Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- Noninteractive Zero-Knowledge
- Number-theoretic constructions of efficient pseudo-random functions
- On lattices, learning with errors, random linear codes, and cryptography
- On the correlation intractability of obfuscated pseudorandom functions
- Perfect Non-interactive Zero Knowledge for NP
- Practical homomorphic MACs for arithmetic circuits
- Practical Round-Optimal Blind Signatures in the Standard Model
- Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions
- Proofs of Retrievability via Hardness Amplification
- Proofs of storage from homomorphic identification protocols
- Proofs on Encrypted Values in Bilinear Groups and an Application to Anonymity of Signatures
- Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions
- Public-key cryptosystems from the worst-case shortest vector problem
- Publicly Verifiable Non-Interactive Zero-Knowledge Proofs
- Reusable designated-verifier NIZKs for all NP from CDH
- Riding on asymmetry: efficient ABE for branching programs
- Round optimal blind signatures
- Round-Optimal Composable Blind Signatures in the Common Reference String Model
- Secure network coding over the integers
- Security arguments for digital signatures and blind signatures
- Security in Communication Networks
- Security of Sanitizable Signatures Revisited
- Security proofs for signature schemes
- Short non-interactive zero-knowledge proofs
- Signing a Linear Subspace: Signature Schemes for Network Coding
- Simple Lattice Trapdoor Sampling from a Broad Class of Distributions
- Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
- Smooth projective hashing and password-based authenticated key exchange from lattices
- Structure-preserving signatures and commitments to group elements
- The knowledge complexity of interactive proof-systems
- The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme
- Theory of Cryptography
- Theory of Cryptography
- Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
- Towards non-interactive zero-knowledge for NP from LWE
- Trapdoors for hard lattices and new cryptographic constructions
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Two round multiparty computation via multi-key FHE
- Two-round multiparty secure computation from minimal assumptions
- Two-round PAKE from approximate SPH and instantiations from lattices
- Unconditional Characterizations of Non-interactive Zero-Knowledge
- Universally composable two-party and multi-party secure computation
- Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- Zero-knowledge proofs from secure multiparty computation
This page was built for publication: Multi-theorem preprocessing NIZKs from lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5918862)
