Keyed-verification anonymous credentials with highly efficient partial disclosure

DOI10.62056/AEY7N59P1MaRDI QIDQ7390768zbMATH OpenFDO

Authors Omid Mirzamohammadi, Jan Bobolz, Mahdi Sedaghat, Emad Heydari Beni, A. Abidin, Dave Singelée, Bart Preneel

Publication date 2025

Published in IACR Communications in Cryptology (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.62056/AEY7N59P1

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Cites work

• (Hierarchical) identity-based encryption from affine message authentication
• Advances in Cryptology – CRYPTO 2004
• Advances in Cryptology – CRYPTO 2004
• Algebraic group model with oblivious sampling
• Composable and modular anonymous credentials: definitions and practical constructions
• Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
• Cryptography and Coding
• Delegatable anonymous credentials from mercurial signatures
• Efficient redactable signature and application to anonymous credentials
• Efficient signatures on randomizable ciphertexts
• Hierarchical Identity Based Encryption with Constant Size Ciphertext
• 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 4191111 (Why is no real title available?)
• scientific article; zbMATH DE number 3825707 (Why is no real title available?)
• scientific article; zbMATH DE number 1088250 (Why is no real title available?)
• scientific article; zbMATH DE number 1952906 (Why is no real title available?)
• Improved algebraic MACs and practical keyed-verification anonymous credentials
• Improved constructions of anonymous credentials from structure-preserving signatures on equivalence classes
• Message authentication, revisited
• NIZKs with an untrusted CRS: security in the face of parameter subversion
• Non-interactive keyed-verification anonymous credentials
• On expected polynomial runtime in cryptography
• On modeling terrorist frauds. Addressing collusion in distance bounding protocols
• On security proofs of existing equivalence class signature schemes
• Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
• Pairings for cryptographers
• Selective delegation of attributes in mercurial signature credentials
• Server-aided anonymous credentials
• Short randomizable signatures
• Short signatures without random oracles and the SDH assumption in bilinear groups
• Structure-preserving signatures on equivalence classes and constant-size anonymous credentials
• Structure-Preserving Signatures on Equivalence Classes and Their Application to Anonymous Credentials
• The uber-knowledge assumption: a bridge to the AGM
• Threshold structure-preserving signatures
• Topics in Cryptology – CT-RSA 2005
• Unifying Zero-Knowledge Proofs of Knowledge
• Weakly secure equivalence-class signatures from standard assumptions

This page was built for publication: Keyed-verification anonymous credentials with highly efficient partial disclosure

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7390768)