PAPR: publicly auditable privacy revocation for anonymous credentials

DOI10.1007/978-3-031-30872-7_7MaRDI QIDQ6080901zbMATH OpenOpenAlexFDO

Authors Joakim Brorsson, Bernardo David, Lorenzo G. C. Gentile, Elena Pagnin, Paul Stankovski Wagner

Publication date 4 October 2023

Published in Topics in Cryptology – CT-RSA 2023 (Search for Journal in Brave)

Full work available at URL https://eprint.iacr.org/2023/137.pdf

zbMATH Keywords

universal composabilityPAPR anonymous credential scheme

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 1722673
• Solving revocation with efficient update of anonymous credentials
• Formal treatment of privacy-enhancing credential systems
• An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
• An Efficient Anonymous Credential System

Cites work

• scientific article; zbMATH DE number 1676644 (Why is no real title available?)
• scientific article; zbMATH DE number 1722673 (Why is no real title available?)
• scientific article; zbMATH DE number 3825707 (Why is no real title available?)
• scientific article; zbMATH DE number 708801 (Why is no real title available?)
• scientific article; zbMATH DE number 1024065 (Why is no real title available?)
• ALBATROSS: publicly AttestabLe BATched Randomness based On Secret Sharing
• Abuse resistant law enforcement access systems
• Advances in Cryptology – CRYPTO 2004
• Algorand: a secure and efficient distributed ledger
• Bitcoin as a transaction ledger: a composable treatment
• Can a public blockchain keep a secret?
• Composable and modular anonymous credentials: definitions and practical constructions
• Constant-size structure-preserving signatures: generic constructions and simple assumptions
• Delegatable anonymous credentials from mercurial signatures
• Delegatable attribute-based anonymous credentials from dynamically malleable signatures
• Efficient Non-interactive Proof Systems for Bilinear Groups
• Efficient Zero-Knowledge Argument for Correctness of a Shuffle
• Group Signatures
• HotStuff
• How to share a secret
• New techniques for noninteractive zero-knowledge
• On the composition of authenticated byzantine agreement
• Ouroboros Praos: an adaptively-secure, semi-synchronous proof-of-stake blockchain
• Ouroboros: a provably secure proof-of-stake blockchain protocol
• P-signatures and Noninteractive Anonymous Credentials
• Random-index PIR and applications
• SCRAPE: scalable randomness attested by public entities
• Short signatures without random oracles and the SDH assumption in bilinear groups
• Storing and retrieving secrets on a blockchain
• Theory of Cryptography
• Universally composable two-party and multi-party secure computation
• YOSO: You only speak once. Secure MPC with stateless ephemeral roles
• k-Times Anonymous Authentication (Extended Abstract)

Cited in

(3)

• Privacy-preserving blueprints
• ARBRA: Anonymous Reputation-Based Revocation with Efficient Authentication
• Universally composable auditable surveillance

This page was built for publication: PAPR: publicly auditable privacy revocation for anonymous credentials

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