Block-Wise P-Signatures and Non-interactive Anonymous Credentials with Efficient Attributes
From MaRDI portal
Publication:3104713
DOI10.1007/978-3-642-25516-8_26zbMath1291.94104OpenAlexW2150648481MaRDI QIDQ3104713
Damien Vergnaud, Benoît Libert, Malika Izabachène
Publication date: 16 December 2011
Published in: Cryptography and Coding (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-25516-8_26
Related Items
UC Updatable Databases and Applications ⋮ Structure-preserving signatures on equivalence classes and constant-size anonymous credentials ⋮ Counting vampires: from univariate sumcheck to updatable ZK-SNARK ⋮ NIWI and new notions of extraction for algebraic languages ⋮ MoniPoly -- an expressive \(q\)-SDH-based anonymous attribute-based credential system ⋮ Succinct functional commitment for a large class of arithmetic circuits ⋮ Non-Interactive Zero-Knowledge Proofs of Non-Membership ⋮ Privacy-preserving and efficient attributes proof based on selective aggregate CL-signature scheme ⋮ Non-zero Inner Product Encryption with Short Ciphertexts and Private Keys
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Designated Verifier Proofs and Their Applications
- Commuting Signatures and Verifiable Encryption
- Anonymous Fuzzy Identity-Based Encryption for Similarity Search
- Attribute-Based Signatures
- Randomizable Proofs and Delegatable Anonymous Credentials
- Compact E-Cash and Simulatable VRFs Revisited
- Universally Composable Adaptive Priced Oblivious Transfer
- Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs
- About the Security of MTI/C0 and MQV
- Batch Groth–Sahai
- Structure-Preserving Signatures and Commitments to Group Elements
- Efficient Protocols for Set Membership and Range Proofs
- An Efficient Anonymous Credential System
- An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
- A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks
- Threshold Attribute-Based Signatures and Their Application to Anonymous Credential Systems
- Group Encryption: Non-interactive Realization in the Standard Model
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Advances in Cryptology – CRYPTO 2004
- Compact E-Cash
- P-signatures and Noninteractive Anonymous Credentials
- Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Full-Domain Subgroup Hiding and Constant-Size Group Signatures
