Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
From MaRDI portal
Publication:5459095
DOI10.1007/11935230_29zbMath1172.94615OpenAlexW1548963432MaRDI QIDQ5459095
Publication date: 24 April 2008
Published in: Advances in Cryptology – ASIACRYPT 2006 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11935230_29
group signaturesdecisional linear assumptionNon-interactive zero-knowledgesimulation-sound extractability
Related Items (91)
Verifiable Inner Product Encryption Scheme ⋮ Bringing Order to Chaos: The Case of Collision-Resistant Chameleon-Hashes ⋮ On Black-Box Extensions of Non-interactive Zero-Knowledge Arguments, and Signatures Directly from Simulation Soundness ⋮ Structure-preserving signatures and commitments to group elements ⋮ QA-NIZK Arguments of Same Opening for Bilateral Commitments ⋮ Signatures of Knowledge for Boolean Circuits Under Standard Assumptions ⋮ Tightly secure signatures and public-key encryption ⋮ Generic Framework for Attribute-Based Group Signature ⋮ Signatures of knowledge for Boolean circuits under standard assumptions ⋮ Structure-Preserving Signatures from Standard Assumptions, Revisited ⋮ Short Group Signatures via Structure-Preserving Signatures: Standard Model Security from Simple Assumptions ⋮ Another look at extraction and randomization of Groth's zk-SNARK ⋮ Constant-size structure-preserving signatures: generic constructions and simple assumptions ⋮ Issuer-hiding attribute-based credentials ⋮ Selectively linkable group signatures -- stronger security and preserved verifiability ⋮ Subversion-resistant quasi-adaptive NIZK and applications to modular zk-SNARKs ⋮ Skipping the \(q\) in group signatures ⋮ Dual-mode NIZKs: possibility and impossibility results for property transfer ⋮ On black-box extension of a non-interactive zero-knowledge proof system for secret equality ⋮ Subversion-resilient enhanced privacy ID ⋮ Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs ⋮ More efficient structure-preserving signatures -- or: bypassing the type-III lower bounds ⋮ Efficient Non-interactive Range Proof ⋮ Fiat-Shamir bulletproofs are non-malleable (in the algebraic group model) ⋮ Continuously non-malleable secret sharing for general access structures ⋮ Hardware security without secure hardware: how to decrypt with a password and a server ⋮ Efficient Distributed Tag-Based Encryption and Its Application to Group Signatures with Efficient Distributed Traceability ⋮ Linearly homomorphic structure-preserving signatures and their applications ⋮ Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge ⋮ Witness-succinct universally-composable SNARKs ⋮ Spartan and bulletproofs are simulation-extractable (for free!) ⋮ A survey of elliptic curves for proof systems ⋮ QANIZK for adversary-dependent languages and their applications ⋮ Extendable threshold ring signatures with enhanced anonymity ⋮ NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion ⋮ Unique-path identity based encryption with applications to strongly secure messaging ⋮ Deniable authentication when signing keys leak ⋮ Anonymous yet Traceable Strong Designated Verifier Signature ⋮ Logarithmic-size (linkable) threshold ring signatures in the plain model ⋮ Obtaining simulation extractable NIZKs in the updatable CRS model generically ⋮ DAG-\( \Sigma \): a DAG-based sigma protocol for relations in CNF ⋮ Generic constructions of master-key KDM secure attribute-based encryption ⋮ Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs ⋮ Compact Ring Signature in the Standard Model for Blockchain ⋮ Updatable NIZKs from non-interactive zaps ⋮ Auditable asymmetric password authenticated public key establishment ⋮ CRS-updatable asymmetric quasi-adaptive NIZK arguments ⋮ Shorter quasi-adaptive NIZK proofs for linear subspaces ⋮ Network-agnostic security comes (almost) for free in DKG and MPC ⋮ On the impossibility of algebraic NIZK in pairing-free groups ⋮ Efficient traceable signatures in the standard model ⋮ Traceable policy-based signatures and instantiation from lattices ⋮ Non-interactive composition of sigma-protocols via Share-then-Hash ⋮ Constructions Secure Against Receiver Selective Opening and Chosen Ciphertext Attacks ⋮ Adaptively secure non-interactive CCA-secure threshold cryptosystems: generic framework and constructions ⋮ Foundations of fully dynamic group signatures ⋮ Continuously non-malleable codes in the split-state model ⋮ On the tightness of forward-secure signature reductions ⋮ Fully Anonymous Group Signatures Without Random Oracles ⋮ Group Encryption ⋮ Breaking and Fixing Anonymous Credentials for the Cloud ⋮ Bounded tamper resilience: how to go beyond the algebraic barrier ⋮ Secret, verifiable auctions from elections ⋮ Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS ⋮ Tagged One-Time Signatures: Tight Security and Optimal Tag Size ⋮ Verifiable Elections That Scale for Free ⋮ Compact structure-preserving signatures with almost tight security ⋮ Improved Structure Preserving Signatures Under Standard Bilinear Assumptions ⋮ Scalable Multi-party Private Set-Intersection ⋮ Structure-Preserving Chosen-Ciphertext Security with Shorter Verifiable Ciphertexts ⋮ Functional Encryption: Deterministic to Randomized Functions from Simple Assumptions ⋮ Bloom filter encryption and applications to efficient forward-secret 0-RTT key exchange ⋮ Reconfigurable Cryptography: A Flexible Approach to Long-Term Security ⋮ Multi-theorem preprocessing NIZKs from lattices ⋮ Fully leakage-resilient signatures revisited: graceful degradation, noisy leakage, and construction in the bounded-retrieval model ⋮ On subversion-resistant SNARKs ⋮ Non-interactive Confirmer Signatures ⋮ Attribute-Based Signatures ⋮ An Efficient Post-Quantum One-Time Signature Scheme ⋮ Cryptography in the multi-string model ⋮ A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks ⋮ One-Time Signatures and Chameleon Hash Functions ⋮ Identity-Based Group Encryption ⋮ Foundations of Fully Dynamic Group Signatures ⋮ Proofs on Encrypted Values in Bilinear Groups and an Application to Anonymity of Signatures ⋮ Efficient Traceable Signatures in the Standard Model ⋮ Short tightly secure signatures for signing a vector of group elements: a new approach ⋮ Optimally Sound Sigma Protocols Under DCRA ⋮ Reverse firewalls for actively secure MPCs ⋮ Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages ⋮ 0-RTT Key Exchange with Full Forward Secrecy
This page was built for publication: Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
