Anonymous counting tokens
From MaRDI portal
Publication:6562569
Recommendations
Cites work
- A fast and simple partially oblivious PRF, with applications
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology - EUROCRYPT 2004
- Anonymous tokens with private metadata bit
- Anonymous tokens with public metadata and applications to private contact tracing
- Anonymous tokens with stronger metadata bit hiding from algebraic MACs
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Fiat-Shamir transformation of multi-round interactive proofs
- Fine-Tuning Groth-Sahai Proofs
- Foundations of Cryptography
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- scientific article; zbMATH DE number 3825707 (Why is no real title available?)
- scientific article; zbMATH DE number 1304081 (Why is no real title available?)
- scientific article; zbMATH DE number 1088224 (Why is no real title available?)
- scientific article; zbMATH DE number 1162684 (Why is no real title available?)
- scientific article; zbMATH DE number 1406779 (Why is no real title available?)
- Improved structure preserving signatures under standard bilinear assumptions
- MiMC: efficient encryption and cryptographic hashing with minimal multiplicative complexity
- Public Key Cryptography - PKC 2005
- Structure-preserving signatures on equivalence classes and constant-size anonymous credentials
- Two-sided malicious security for private intersection-sum with cardinality
- Weakly secure equivalence-class signatures from standard assumptions
Cited in
(2)
This page was built for publication: Anonymous counting tokens
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6562569)