Multi-theorem preprocessing NIZKs from lattices

DOI10.1007/s00145-019-09324-0zbMath1457.94151OpenAlexW2941221911WikidataQ127963777 ScholiaQ127963777MaRDI QIDQ5918862

No author found.

Publication date: 15 June 2020

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-019-09324-0

zbMATH Keywords

latticesMPCblind signatureszero-knowledgeNIZK

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Uses Software

• DVNIZK

Cites Work

• Generating Shorter Bases for Hard Random Lattices
• Generalizing Homomorphic MACs for Arithmetic Circuits
• Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
• Advances in Cryptology - CRYPTO 2003
• An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
• Unconditional Characterizations of Non-interactive Zero-Knowledge
• Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
• Efficient Non-interactive Proof Systems for Bilinear Groups
• Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
• Security in Communication Networks
• Classical hardness of learning with errors
• Two Round Multiparty Computation via Multi-key FHE
• Round-Optimal Composable Blind Signatures in the Common Reference String Model
• Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One
• Theory of Cryptography
• On lattices, learning with errors, random linear codes, and cryptography
• Theory of Cryptography
• Multi-theorem preprocessing NIZKs from lattices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs
• Definitions and properties of zero-knowledge proof systems
• An efficient noninteractive zero-knowledge proof system for NP with general assumptions
• The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme
• Security arguments for digital signatures and blind signatures
• Certifying trapdoor permutations, revisited
• A formal concept of domain pseudonymous signatures
• Fiat-Shamir and correlation intractability from strong KDM-secure encryption
• Two-round multiparty secure computation from minimal assumptions
• Efficient designated-verifier non-interactive zero-knowledge proofs of knowledge
• From obfuscation to the security of Fiat-Shamir for proofs
• Two-round PAKE from approximate SPH and instantiations from lattices
• New (and old) proof systems for lattice problems
• Hash proof systems over lattices revisited
• Noninteractive zero knowledge for NP from (Plain) Learning With Errors
• Towards non-interactive zero-knowledge for NP from LWE
• Designated-verifier pseudorandom generators, and their applications
• Reusable designated-verifier NIZKs for all NP from CDH
• Designated verifier/prover and preprocessing NIZKs from Diffie-Hellman assumptions
• New constructions of reusable designated-verifier NIZKs
• Computing on authenticated data
• Enhancements of trapdoor permutations
• On the Correlation Intractability of Obfuscated Pseudorandom Functions
• Riding on Asymmetry: Efficient ABE for Branching Programs
• Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions
• Breaking the Circuit Size Barrier for Secure Computation Under DDH
• Hardness of SIS and LWE with Small Parameters
• Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
• Fully Homomorphic Message Authenticators
• Faster Bootstrapping with Polynomial Error
• Homomorphic Signatures with Efficient Verification for Polynomial Functions
• Security Proofs for Signature Schemes
• Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
• Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
• Efficient Network Coding Signatures in the Standard Model
• Improved Security for Linearly Homomorphic Signatures: A Generic Framework
• Multiparty Computation from Somewhat Homomorphic Encryption
• Homomorphic Signatures and Message Authentication Codes
• Making Sigma-Protocols Non-interactive Without Random Oracles
• Simple Lattice Trapdoor Sampling from a Broad Class of Distributions
• Leveled Fully Homomorphic Signatures from Standard Lattices
• Multi-key Homomorphic Authenticators
• Lattice-based FHE as secure as PKE
• Homomorphic Signatures for Polynomial Functions
• Short Non-interactive Zero-Knowledge Proofs
• Lattice-Based Blind Signatures
• Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures
• Homomorphic Network Coding Signatures in the Standard Model
• Basing Non-Interactive Zero-Knowledge on (Enhanced) Trapdoor Permutations: The State of the Art
• Number-theoretic constructions of efficient pseudo-random functions
• Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
• Proofs on Encrypted Values in Bilinear Groups and an Application to Anonymity of Signatures
• Practical Round-Optimal Blind Signatures in the Standard Model
• Concurrent Blind Signatures Without Random Oracles
• Trapdoors for hard lattices and new cryptographic constructions
• Secure Network Coding over the Integers
• Bonsai Trees, or How to Delegate a Lattice Basis
• Efficient Lattice (H)IBE in the Standard Model
• Zero-Knowledge Proofs from Secure Multiparty Computation
• Universally composable two-party and multi-party secure computation
• Structure-Preserving Signatures and Commitments to Group Elements
• Perfect Non-interactive Zero Knowledge for NP
• Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
• A Framework for Efficient and Composable Oblivious Transfer
• Compact Proofs of Retrievability
• Proofs of Retrievability via Hardness Amplification
• Security of Sanitizable Signatures Revisited
• Signing a Linear Subspace: Signature Schemes for Network Coding
• Proofs of Storage from Homomorphic Identification Protocols
• A Framework for Universally Composable Non-committing Blind Signatures
• Smooth Projective Hashing and Password-Based Authenticated Key Exchange from Lattices
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Noninteractive Zero-Knowledge
• Publicly Verifiable Non-Interactive Zero-Knowledge Proofs
• The knowledge complexity of interactive proof-systems
• Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
• Almost Perfect Lattices, the Covering Radius Problem, and Applications to Ajtai's Connection Factor
• Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications
• Practical Homomorphic MACs for Arithmetic Circuits
• Fully homomorphic encryption using ideal lattices
• Public-key cryptosystems from the worst-case shortest vector problem
• Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
• Round Optimal Blind Signatures
• Fiat-Shamir: from practice to theory
• How to use indistinguishability obfuscation

This page was built for publication: Multi-theorem preprocessing NIZKs from lattices