Block-wise P-signatures and non-interactive anonymous credentials with efficient attributes
From MaRDI portal
Recommendations
- P-signatures and Noninteractive Anonymous Credentials
- Efficient zero-knowledge proof of algebraic and non-algebraic statements with applications to privacy preserving credentials
- Anonymous credential schemes with encrypted attributes
- Structure-Preserving Signatures on Equivalence Classes and Their Application to Anonymous Credentials
- Structure-preserving signatures on equivalence classes and constant-size anonymous credentials
Cites work
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks
- About the Security of MTI/C0 and MQV
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Advances in Cryptology – CRYPTO 2004
- An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
- An Efficient Anonymous Credential System
- Anonymous fuzzy identity-based encryption for similarity search
- Attribute-based signatures
- Batch Groth-Sahai
- Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
- Commuting signatures and verifiable encryption
- Compact E-Cash
- Compact E-Cash and Simulatable VRFs Revisited
- Concise mercurial vector commitments and independent zero-knowledge sets with short proofs
- Designated verifier proofs and their applications
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Efficient Protocols for Set Membership and Range Proofs
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Full-Domain Subgroup Hiding and Constant-Size Group Signatures
- Group encryption: non-interactive realization in the standard model
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- scientific article; zbMATH DE number 1722673 (Why is no real title available?)
- scientific article; zbMATH DE number 176545 (Why is no real title available?)
- scientific article; zbMATH DE number 1088224 (Why is no real title available?)
- scientific article; zbMATH DE number 1952906 (Why is no real title available?)
- scientific article; zbMATH DE number 2009957 (Why is no real title available?)
- P-signatures and Noninteractive Anonymous Credentials
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- Randomizable Proofs and Delegatable Anonymous Credentials
- Structure-preserving signatures and commitments to group elements
- Threshold Attribute-Based Signatures and Their Application to Anonymous Credential Systems
- Universally Composable Adaptive Priced Oblivious Transfer
Cited in
(22)- Non-interactive keyed-verification anonymous credentials
- Structure-preserving signatures on equivalence classes and constant-size anonymous credentials
- 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
- Composable and modular anonymous credentials: definitions and practical constructions
- Privacy-preserving and efficient attributes proof based on selective aggregate CL-signature scheme
- Non-zero inner product encryption with short ciphertexts and private keys
- Efficient zero-knowledge proof of algebraic and non-algebraic statements with applications to privacy preserving credentials
- Anonymous credential schemes with encrypted attributes
- Randomizable Proofs and Delegatable Anonymous Credentials
- scientific article; zbMATH DE number 2043307 (Why is no real title available?)
- UC Updatable Databases and Applications
- P-signatures and Noninteractive Anonymous Credentials
- An efficient self-blindable attribute-based credential scheme
- Counting vampires: from univariate sumcheck to updatable ZK-SNARK
- NIWI and new notions of extraction for algebraic languages
- Protego: efficient, revocable and auditable anonymous credentials with applications to hyperledger fabric
- An Anonymous Credential System with Constant-Size Attribute Proofs for CNF Formulas with Negations
- On black-box knowledge-sound commit-and-prove SNARKs
- Predicate aggregate signatures and applications
- Selective delegation of attributes in mercurial signature credentials
This page was built for publication: Block-wise P-signatures and non-interactive anonymous credentials with efficient attributes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3104713)
