New Constructions of Reusable Designated-Verifier NIZKs

No abstract is available for this paper.

• Publication year

  2019

• Venue

  IACR Cryptology ePrint Archive

• Publication date

  2019-08-18

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-3-030-26954-8_22
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Two-Round Oblivious Transfer from CDH or LPN

  2020influential reference
• Designated Verifier/Prover and Preprocessing NIZKs from Diffie-Hellman Assumptions

  2019cited by this paper
• CPA-to-CCA Transformation for KDM Security

  2019cited by this paper
• Reusable Designated-Verifier NIZKs for all NP from CDH

  2019cited by this paper
• Noninteractive Zero Knowledge for NP from (Plain) Learning With Errors

  2019cited by this paper
• Fiat-Shamir : From Practice to Theory , Part II NIZK and Correlation Intractability from Circular-Secure FHE

  2019cited by this paper
• CCA Security and Trapdoor Functions via Key-Dependent-Message Security

  2019influential reference
• New Techniques for Efficient Trapdoor Functions and Applications

  2019cited by this paper
• Realizing Chosen Ciphertext Security Generically in Attribute-Based Encryption and Predicate Encryption

  2019influential reference
• Reusable Non-Interactive Secure Computation

  2019influential reference
• Designated-verifier pseudorandom generators, and their applications

  2019cited by this paper
• Non-Interactive Zero Knowledge and Correlation Intractability from Circular-Secure FHE

  2018cited by this paper
• Fiat-Shamir From Simpler Assumptions

  2018cited by this paper
• Trapdoor Functions from the Computational Diffie-Hellman Assumption

  2018cited by this paper
• Compressing Vector OLE

  2018cited by this paper
• Multi-theorem Preprocessing NIZKs from Lattices

  2018cited by this paper
• Fiat-Shamir and Correlation Intractability from Strong KDM-Secure Encryption

  2018cited by this paper
• Anonymous IBE, Leakage Resilience and Circular Security from New Assumptions

  2018cited by this paper
• New Constructions of Identity-Based and Key-Dependent Message Secure Encryption Schemes

  2018cited by this paper
• Laconic Oblivious Transfer and Its Applications

  2017cited by this paper
• Identity-Based Encryption from the Diffie-Hellman Assumption

  2017cited by this paper
• Simple Lattice Trapdoor Sampling from a Broad Class of Distributions

  2015cited by this paper
• Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits

  2014cited by this paper
• Attribute-based encryption for circuits

  2013cited by this paper
• Classical hardness of learning with errors

  2013cited by this paper
• Foundations of garbled circuits

  2012cited by this paper
• Functional Encryption with Bounded Collusions via Multi-party Computation

  2012cited by this paper
• Pseudorandom Functions and Lattices

  2012cited by this paper
• On Efficient Zero-Knowledge PCPs

  2012cited by this paper
• Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller

  2012cited by this paper
• Basing Non-Interactive Zero-Knowledge on (Enhanced) Trapdoor Permutations: The State of the Art

  2011cited by this paper
• Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions

  2011cited by this paper
• Worry-free encryption: functional encryption with public keys

  2010cited by this paper
• Bonsai Trees, or How to Delegate a Lattice Basis

  2010cited by this paper
• How to Prove a Theorem So No One Else Can Claim It

  2010cited by this paper
• Efficient Lattice (H)IBE in the Standard Model

  2010cited by this paper
• Generating Shorter Bases for Hard Random Lattices

  2009cited by this paper
• Chosen-Ciphertext Security via Correlated Products

  2009cited by this paper
• Public-key cryptosystems from the worst-case shortest vector problem: extended abstract

  2009cited by this paper
• Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems

  2009cited by this paper
• A Proof of Security of Yao’s Protocol for Two-Party Computation

  2009cited by this paper
• Trapdoors for hard lattices and new cryptographic constructions

  2008cited by this paper
• Lossy trapdoor functions and their applications

  2008cited by this paper
• Circular-Secure Encryption from Decision Diffie-Hellman

  2008cited by this paper
• Zero-knowledge from secure multiparty computation

  2007cited by this paper
• Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One

  2006cited by this paper
• Attribute-based encryption for fine-grained access control of encrypted data

  2006cited by this paper
• Non-interactive Zaps and New Techniques for NIZK

  2006cited by this paper
• On lattices, learning with errors, random linear codes, and cryptography

  2005cited by this paper
• Fuzzy Identity-Based Encryption

  2005cited by this paper
• Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data

  2004cited by this paper
• Efficient Selective-ID Secure Identity Based Encryption Without Random Oracles

  2004cited by this paper
• Immunizing Encryption Schemes from Decryption Errors

  2004cited by this paper
• More on Average Case vs Approximation Complexity

  2003cited by this paper
• A Forward-Secure Public-Key Encryption Scheme

  2003cited by this paper
• Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption

  2001cited by this paper
• Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions

  1999cited by this paper
• Generating Hard Instances of the Short Basis Problem

  1999cited by this paper
• A Pseudorandom Generator from any One-way Function

  1999cited by this paper
• A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack

  1998cited by this paper
• Non-interactive and non-malleable commitment

  1998cited by this paper
• Probabilistically checkable proofs with zero knowledge

  1997cited by this paper
• Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols

  1994cited by this paper
• Generalized Secret Sharing and Monotone Functions

  1990cited by this paper
• Public-key cryptosystems provably secure against chosen ciphertext attacks

  1990cited by this paper
• The Knowledge Complexity of Interactive Proof Systems

  1989cited by this paper
• Bit commitment using pseudorandomness

  1989cited by this paper
• Non-interactive zero-knowledge and its applications

  1988cited by this paper
• Non-Interactive Zero-Knowledge Proof Systems

  1987cited by this paper
• How to Prove Yourself: Practical Solutions to Identification and Signature Problems

  1986cited by this paper
• Proofs that yield nothing but their validity and a methodology of cryptographic protocol design

  1986cited by this paper
• How to generate and exchange secrets

  1986cited by this paper
• A public key cyryptosystem and signature scheme based on discrete logarithms

  1985cited by this paper
• How to Construct Random Functions (Extended Abstract)

  1984cited by this paper
• A public key cryptosystem and a signature scheme based on discrete logarithms

  1984cited by this paper
• SRI International

  1982cited by this paper

• Randomness Recoverable Secret Sharing Schemes

  2024cites this paper
• Batch Arguments to NIZKs from One-Way Functions

  2023cites this paper
• Deniable Authentication when Signing Keys Leak

  2023cites this paper
• More Efficient Zero-Knowledge Protocols over ℤ2k via Galois Rings

  2023cites this paper
• A Generic Transform from Multi-Round Interactive Proof to NIZK

  2023cites this paper
• A Note on Non-Interactive Zero-Knowledge from CDH

  2023cites this paper
• Universal Amplification of KDM Security: From 1-Key Circular to Multi-Key KDM

  2023influential citation
• CCA Security and Trapdoor Functions via Key-Dependent-Message Security

  2022cites this paper
• How to Build a Trapdoor Function from an Encryption Scheme

  2021influential citation
• Toward Non-interactive Zero-Knowledge Proofs for NP from LWE

  2021cites this paper
• Unbounded Multi-Party Computation from Learning with Errors

  2021cites this paper
• On the Randomness Complexity of Interactive Proofs and Statistical Zero-Knowledge Proofs

  2021cites this paper
• Multi-theorem Designated-Verifier NIZK for QMA

  2021cites this paper
• Compact Designated Verifier NIZKs from the CDH Assumption Without Pairings

  2021cites this paper
• Amortizing Rate-1 OT and Applications to PIR and PSI

  2021cites this paper
• Multi-theorem (Malicious) Designated-Verifier NIZK for QMA

  2020cites this paper
• Circular Security Is Complete for KDM Security

  2020cites this paper
• Cryptographic Group Actions and Applications

  2020cites this paper
• On The Round Complexity of Two-Party Quantum Computation

  2020cites this paper
• Receiver Selective Opening CCA Secure Public Key Encryption from Various Assumptions

  2020cites this paper
• Correlated Pseudorandom Functions from Variable-Density LPN

  2020cites this paper
• Line-Point Zero Knowledge and Its Applications

  2020cites this paper
• Simulation-Sound Arguments for LWE and Applications to KDM-CCA2 Security

  2020cites this paper
• New Constructions of Statistical NIZKs: Dual-Mode DV-NIZKs and More

  2020cites this paper
• Two-Round Oblivious Transfer from CDH or LPN

  2020cites this paper
• Master-Key KDM-Secure IBE from Pairings

  2020cites this paper
• New Constructions of Hinting PRGs, OWFs with Encryption, and more

  2020cites this paper
• Non-interactive Zero-Knowledge in Pairing-Free Groups from Weaker Assumptions

  2020cites this paper
• Dual-Mode NIZKs: Possibility and Impossibility Results for Property Transfer

  2020cites this paper
• Efficient Range-Trapdoor Functions and Applications: Rate-1 OT and More

  2019cites this paper
• Rate-1 Trapdoor Functions from the Diffie-Hellman Problem

  2019cites this paper
• Towards Secure Computation with Optimal Complexity

  2019cites this paper
• Realizing Chosen Ciphertext Security Generically in Attribute-Based Encryption and Predicate Encryption

  2019cites this paper
• CCA Security and Trapdoor Functions via Key-Dependent-Message Security

  2019cites this paper
• CPA-to-CCA Transformation for KDM Security

  2019cites this paper
• Laconic Conditional Disclosure of Secrets and Applications

  2019cites this paper
• Multi-theorem Preprocessing NIZKs from Lattices

  2018cites this paper
• Efficient Range-Trapdoor Functions and Applications: Rate-1 OT and More

  year unknowncites this paper