On Black-Box Extensions of Non-interactive Zero-Knowledge Arguments, and Signatures Directly from Simulation Soundness

DOI10.1007/978-3-030-45374-9_19zbMath1502.94023OpenAlexW3023107923MaRDI QIDQ5041170

Miguel Ambrona, Miyako Ohkubo, Masayuki Abe

Publication date: 13 October 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-45374-9_19

zbMATH Keywords

public-key encryption schemesnon-malleable non-interactive zero-knowledge proof system

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (2)

On black-box extension of a non-interactive zero-knowledge proof system for secret equality ⋮ Black-box use of one-way functions is useless for optimal fair coin-tossing

Uses Software

• MQ Challenge

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Structure-preserving signatures and commitments to group elements
• Tightly secure signatures and public-key encryption
• Constructing public-key cryptographic schemes based on class group action on a set of isogenous elliptic curves
• Snarky signatures: minimal signatures of knowledge from simulation-extractable snarks
• New (and old) proof systems for lattice problems
• Noninteractive zero knowledge for NP from (Plain) Learning With Errors
• Towards non-interactive zero-knowledge for NP from LWE
• Threshold password-authenticated key exchange
• Mitigating Multi-target Attacks in Hash-Based Signatures
• Shorter Quasi-Adaptive NIZK Proofs for Linear Subspaces
• Security Proofs for Signature Schemes
• Concise Multi-challenge CCA-Secure Encryption and Signatures with Almost Tight Security
• Disjunctions for Hash Proof Systems: New Constructions and Applications
• Quasi-Adaptive NIZK for Linear Subspaces Revisited
• Signatures Resilient to Continual Leakage on Memory and Computation
• Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions
• A complete problem for statistical zero knowledge
• Short Group Signatures via Structure-Preserving Signatures: Standard Model Security from Simple Assumptions
• Domain Extension for Enhanced Target Collision-Resistant Hash Functions
• Perfect Non-interactive Zero Knowledge for NP
• Towards a Separation of Semantic and CCA Security for Public Key Encryption
• Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
• A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks
• Signature Schemes with Bounded Leakage Resilience
• The complexity of promise problems with applications to public-key cryptography
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Breaking RSA may not be equivalent to factoring
• Efficient Noninteractive Proof Systems for Bilinear Groups
• Tagged One-Time Signatures: Tight Security and Optimal Tag Size
• Fiat-Shamir: from practice to theory
• Stretching Groth-Sahai: NIZK Proofs of Partial Satisfiability
• Efficient Round Optimal Blind Signatures
• Separating succinct non-interactive arguments from all falsifiable assumptions
• Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
• Strengthening Digital Signatures Via Randomized Hashing
• Theory of Cryptography
• Multi-theorem preprocessing NIZKs from lattices

This page was built for publication: On Black-Box Extensions of Non-interactive Zero-Knowledge Arguments, and Signatures Directly from Simulation Soundness