An efficient system for non-transferable anonymous credentials with optional anonymity revocation
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Fiat-Shamir and correlation intractability from strong KDM-secure encryption
- Reproducible circularly secure bit encryption: applications and realizations
- Improved algebraic MACs and practical keyed-verification anonymous credentials
- On the impossibility of structure-preserving deterministic primitives
- Private authentication
- Security under message-derived keys: signcryption in iMessage
- Round-optimal blind signatures in the plain model from classical and quantum standard assumptions
- Large scale, actively secure computation from LPN and free-XOR garbled circuits
- Group signatures with user-controlled and sequential linkability
- Rate-1 key-dependent message security via reusable homomorphic extractor against correlated-source attacks
- Master-key KDM-secure ABE via predicate encoding
- Anonymous tokens with private metadata bit
- Lattice-based blind signatures, revisited
- TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures
- Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model
- Counterexamples to new circular security assumptions underlying iO
- Issuer-hiding attribute-based credentials
- Anonymous, robust post-quantum public key encryption
- Anonymity of NIST PQC round 3 KEMs
- KDM security for identity-based encryption: constructions and separations
- Non-interactive keyed-verification anonymous credentials
- Efficient fully structure-preserving signatures and shrinking commitments
- Naor-Yung paradigm with shared randomness and applications
- Structure-preserving signatures on equivalence classes and constant-size anonymous credentials
- MoniPoly -- an expressive \(q\)-SDH-based anonymous attribute-based credential system
- Updatable public key encryption in the standard model
- Policy-compliant signatures
- Completeness of single-bit projection-KDM security for public key encryption
- Recovering lost device-bound credentials
- Composable and modular anonymous credentials: definitions and practical constructions
- Formal treatment of privacy-enhancing credential systems
- Towards lightweight anonymous entity authentication for IoT applications
- Naor-Yung Paradigm with Shared Randomness and Applications
- Bounded KDM security from iO and OWF
- Three’s Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWE
- Circular Security Separations for Arbitrary Length Cycles from LWE
- Efficient zero-knowledge proof of algebraic and non-algebraic statements with applications to privacy preserving credentials
- Signatures and efficient proofs on committed graphs and NP-statements
- Efficient KDM-CCA secure public-key encryption for polynomial functions
- Structure-preserving smooth projective hashing
- Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
- How to obtain fully structure-preserving (automorphic) signatures from structure-preserving ones
- Non-transferable User Certification Secure against Authority Information Leaks and Impersonation Attacks
- Anonymous credential schemes with encrypted attributes
- Policy-based signature scheme from lattices
- Key-dependent message security for division function: discouraging anonymous credential sharing
- Block-wise P-signatures and non-interactive anonymous credentials with efficient attributes
- A secure electronic exam system
- Garbling XOR gates ``for free in the standard model
- Breaking and fixing anonymous credentials for the cloud
- ARBRA: Anonymous Reputation-Based Revocation with Efficient Authentication
- Anonymous authentication with optional shared anonymity revocation and linkability
- A new approach to efficient revocable attribute-based anonymous credentials
- An Open Mobile Identity Tool: An Architecture for Mobile Identity Management
- Solving revocation with efficient update of anonymous credentials
- OAEP Is Secure under Key-Dependent Messages
- Fair Traceable Multi-Group Signatures
- An Efficient Anonymous Credential System
- Dynamic Universal Accumulators for DDH Groups and Their Application to Attribute-Based Anonymous Credential Systems
- 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
- scientific article; zbMATH DE number 2043307 (Why is no real title available?)
- scientific article; zbMATH DE number 2081085 (Why is no real title available?)
- Efficient oblivious transfers with access control
- Decentralized attribute-based signatures
- A Suite of Non-pairing ID-Based Threshold Ring Signature Schemes with Different Levels of Anonymity (Extended Abstract)
- Pseudonym systems. (Extended abstract)
- Garbled circuits as randomized encodings of functions: a primer
- Group signatures with decentralized tracing
- The KDM-CCA Security of REACT
- Rational modular encoding in the DCR setting: non-interactive range proofs and Paillier-based Naor-Yung in the standard model
- Separating semantic and circular security for symmetric-key bit encryption from the learning with errors assumption
- Group Encryption
- Applied Cryptography and Network Security
- Towards Key-Dependent Message Security in the Standard Model
- Information Security and Privacy
- Information Security
- Separating IND-CPA and Circular Security for Unbounded Length Key Cycles
- Removing the strong RSA assumption from arguments over the integers
- An efficient self-blindable attribute-based credential scheme
- Survey of lattice-based group signature
- Soundness of Formal Encryption in the Presence of Key-Cycles
- CCA security and trapdoor functions via key-dependent-message security
- Anonymous tokens with public metadata and applications to private contact tracing
- Privacy-preserving blueprints
- PAPR: publicly auditable privacy revocation for anonymous credentials
- Rai-Choo! Evolving blind signatures to the next level
- Unidirectional updatable encryption and proxy re-encryption from DDH
- Post-quantum anonymity of Kyber
- A new framework for more efficient round-optimal lattice-based (partially) blind signature via trapdoor sampling
- Relaxed Lattice-Based Signatures with Short Zero-Knowledge Proofs
- PI-Cut-Choo and friends: compact blind signatures via parallel instance cut-and-choose and more
- Two faces of blindness
- KDM security for the Fujisaki-Okamoto transformations in the QROM
- Credential transparency system
- NIWI and new notions of extraction for algebraic languages
- Lattice signature with efficient protocols, application to anonymous credentials
- Anonymous tokens with stronger metadata bit hiding from algebraic MACs
- Universal amplification of KDM security: from 1-key circular to multi-key KDM
- \textsf{CSI-Otter}: isogeny-based (partially) blind signatures from the class group action with a twist
This page was built for publication: An efficient system for non-transferable anonymous credentials with optional anonymity revocation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2778843)
