Non-interactive zero-knowledge from LPN and MQ
From MaRDI portal
Recommendations
- NIZK from LPN and trapdoor hash via correlation intractability for approximable relations
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- Efficient NIZKs from LWE via polynomial reconstruction and ``MPC in the head
- Towards non-interactive zero-knowledge for NP from LWE
- A note on non-interactive zero-knowledge from CDH
Cites work
- A forward-secure public-key encryption scheme
- A Framework for Efficient and Composable Oblivious Transfer
- A note on non-interactive zero-knowledge from CDH
- A polynomial-time algorithm for solving a class of underdetermined multivariate quadratic equations over fields of odd characteristics
- ABE for circuits with constant-size secret keys and adaptive security
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology - EUROCRYPT 2004
- Anonymous IBE, leakage resilience and circular security from new assumptions
- Another round of breaking and making quantum money: how to not build it from lattices, and more
- Attribute-based encryption for circuits
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
- Boosting batch arguments and RAM delegation
- Breaking rainbow takes a weekend on a laptop
- Certifying permutations: Noninteractive zero-knowledge based on any trapdoor permutation
- Certifying trapdoor permutations, revisited
- Collusion resistant traitor tracing from learning with errors
- Correlation intractability and SNARGs from sub-exponential DDH
- Could SFLASH be Repaired?
- Cryptanalysis of Multivariate and Odd-Characteristic HFE Variants
- Cryptanalysis of the lifted unbalanced oil vinegar signature scheme
- Cryptography with auxiliary input and trapdoor from constant-noise LPN
- Efficient algorithms for solving overdefined systems of multivariate polynomial equations
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Efficient NIZKs from LWE via polynomial reconstruction and ``MPC in the head
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Efficient pseudorandom correlation generators: silent OT extension and more
- Enhancements of trapdoor permutations
- Extended algorithm for solving underdefined multivariate quadratic equations
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption
- Fiat-Shamir: from practice to theory
- Field lifting for smaller UOV public keys
- Fully succinct batch arguments for \textsf{NP} from indistinguishability obfuscation
- Hidden fields equations (HFE) and isomorphisms of polynomials (IP): two new families of asymmetric algorithms
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- How to use indistinguishability obfuscation
- scientific article; zbMATH DE number 1617934 (Why is no real title available?)
- scientific article; zbMATH DE number 2085432 (Why is no real title available?)
- scientific article; zbMATH DE number 3912273 (Why is no real title available?)
- scientific article; zbMATH DE number 4053065 (Why is no real title available?)
- scientific article; zbMATH DE number 4070803 (Why is no real title available?)
- scientific article; zbMATH DE number 4101089 (Why is no real title available?)
- scientific article; zbMATH DE number 1302783 (Why is no real title available?)
- scientific article; zbMATH DE number 1302851 (Why is no real title available?)
- scientific article; zbMATH DE number 708823 (Why is no real title available?)
- scientific article; zbMATH DE number 1024063 (Why is no real title available?)
- scientific article; zbMATH DE number 1030996 (Why is no real title available?)
- scientific article; zbMATH DE number 2009960 (Why is no real title available?)
- scientific article; zbMATH DE number 2009983 (Why is no real title available?)
- scientific article; zbMATH DE number 1418284 (Why is no real title available?)
- Improved cryptanalysis of UOV and Rainbow
- IND-CCA secure cryptography based on a variant of the LPN problem
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)
- Indistinguishability obfuscation from well-founded assumptions
- Lossy cryptography from code-based assumptions
- Lossy encryption: Constructions from general assumptions and efficient selective opening chosen ciphertext security
- Lossy trapdoor functions and their applications
- Low-complexity cryptographic hash functions
- MAYO: practical post-quantum signatures from oil-and-vinegar maps
- Multivariates Polynomials for Hashing
- NIZK from LPN and trapdoor hash via correlation intractability for approximable relations
- Non-interactive batch arguments for NP from standard assumptions
- Non-interactive Zaps and New Techniques for NIZK
- Non-interactive zero knowledge from sub-exponential DDH
- Non-interactive zero-knowledge from non-interactive batch arguments
- Non-interactive zero-knowledge in pairing-free groups from weaker assumptions
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- On lattices, learning with errors, random linear codes, and cryptography
- Optimal broadcast encryption from pairings and LWE
- Perfect Non-interactive Zero Knowledge for NP
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
- Practical cryptanalysis of a public-key encryption scheme based on new multivariate quadratic assumptions
- Practical Cryptanalysis of SFLASH
- Predicate encryption for circuits from LWE
- Public-key cryptography from new multivariate quadratic assumptions
- QUAD: A Practical Stream Cipher with Provable Security
- Quantum FHE (almost) as secure as classical
- Rainbow, a New Multivariable Polynomial Signature Scheme
- Secure PRNGs from Specialized Polynomial Maps over Any $\mathbb{F}_{q}$
- Security in Communication Networks
- Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes
- Simple chosen-ciphertext security from low-noise LPN
- Simple matrix scheme for encryption
- SNARGs and PPAD hardness from the decisional Diffie-Hellman assumption
- SNARGs for bounded depth computations and PPAD hardness from sub-exponential LWE
- SNARGs for monotone policy batch NP
- SNARGs for P from sub-exponential DDH and QR
- Solving underdetermined systems of multivariate quadratic equations revisited
- The knowledge complexity of interactive proof-systems
- The random oracle methodology, revisited.
- Theory of Cryptography
- Two-round oblivious transfer from CDH or LPN
- Unbalanced Oil and Vinegar Signature Schemes
- Unprovable security of perfect NIZK and non-interactive non-malleable commitments
- Worst-case hardness for LPN and cryptographic hashing via code smoothing
Cited in
(4)
This page was built for publication: Non-interactive zero-knowledge from LPN and MQ
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6653050)
