NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion
From MaRDI portal
Publication:2953796
DOI10.1007/978-3-662-53890-6_26zbMath1407.94082OpenAlexW3203084829WikidataQ57433759 ScholiaQ57433759MaRDI QIDQ2953796
Georg Fuchsbauer, Mihir Bellare, Alessandra Scafuro
Publication date: 6 January 2017
Published in: Advances in Cryptology – ASIACRYPT 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-53890-6_26
Related Items (35)
Multi-party revocation in sovrin: performance through distributed trust ⋮ Updateable Inner Product Argument with Logarithmic Verifier and Applications ⋮ On QA-NIZK in the BPK Model ⋮ Practical witness-key-agreement for blockchain-based dark pools financial trading ⋮ Subversion-resistant quasi-adaptive NIZK and applications to modular zk-SNARKs ⋮ Formal verification of fair exchange based on Bitcoin smart contracts ⋮ Subversion-resilient enhanced privacy ID ⋮ A Unified Framework for Non-universal SNARKs ⋮ Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge ⋮ NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion ⋮ On the security of functional encryption in the generic group model ⋮ Structure-preserving signatures on equivalence classes and constant-size anonymous credentials ⋮ Obtaining simulation extractable NIZKs in the updatable CRS model generically ⋮ Counting vampires: from univariate sumcheck to updatable ZK-SNARK ⋮ Reverse firewalls for adaptively secure MPC without setup ⋮ Gentry-Wichs is tight: a falsifiable non-adaptively sound SNARG ⋮ Snarky ceremonies ⋮ Smooth zero-knowledge hash functions ⋮ Updatable NIZKs from non-interactive zaps ⋮ Steganography-free zero-knowledge ⋮ CRS-updatable asymmetric quasi-adaptive NIZK arguments ⋮ Succinct functional commitment for a large class of arithmetic circuits ⋮ Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation ⋮ Practical dynamic group signatures without knowledge extractors ⋮ Cryptographic reverse firewalls for interactive proof systems ⋮ Immunization against complete subversion without random oracles ⋮ Subversion-resilient signatures: definitions, constructions and applications ⋮ On subversion-resistant SNARKs ⋮ How to extract useful randomness from unreliable sources ⋮ Towards accountability in CRS generation ⋮ Impossibility on tamper-resilient cryptography with uniqueness properties ⋮ Subversion-resilient public key encryption with practical watchdogs ⋮ Optimally Sound Sigma Protocols Under DCRA ⋮ New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust ⋮ Computational Integrity with a Public Random String from Quasi-Linear PCPs
Uses Software
Cites Work
- A uniform-complexity treatment of encryption and zero-knowledge
- Definitions and properties of zero-knowledge proof systems
- Lower bounds for non-black-box zero knowledge
- Efficient Fully Structure-Preserving Signatures for Large Messages
- Security of Symmetric Encryption against Mass Surveillance
- Structure-Preserving Signatures from Type II Pairings
- Scalable Zero Knowledge via Cycles of Elliptic Curves
- Distributing the setup in universally composable multi-party computation
- A Formal Treatment of Backdoored Pseudorandom Generators
- Cliptography: Clipping the Power of Kleptographic Attacks
- NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion
- Bringing People of Different Beliefs Together to Do UC
- Short Pairing-Based Non-interactive Zero-Knowledge Arguments
- Efficient Public-Key Cryptography in the Presence of Key Leakage
- Resettable zero-knowledge (extended abstract)
- The Dark Side of “Black-Box” Cryptography or: Should We Trust Capstone?
- Structure-Preserving Signatures and Commitments to Group Elements
- Efficient Indifferentiable Hashing into Ordinary Elliptic Curves
- Perfect Non-interactive Zero Knowledge for NP
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- Lower Bounds for Non-interactive Zero-Knowledge
- Cryptography in the Multi-string Model
- The Knowledge Complexity of Interactive Proof Systems
- Noninteractive Zero-Knowledge
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Nonmalleable Cryptography
- A family of trapdoor ciphers
- On the existence of extractable one-way functions
- Advances in Cryptology – CRYPTO 2004
- Advances in Cryptology – CRYPTO 2004
- Fine-Tuning Groth-Sahai Proofs
- Advances in Cryptology - CRYPTO 2003
- Zaps and Their Applications
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
- On Signatures of Knowledge
- Non-interactive Zaps and New Techniques for NIZK
- Algorithmic Number Theory
- Theory of Cryptography
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion
