Privacy Preserving Data Mining within Anonymous Credential Systems
From MaRDI portal
Recommendations
Cites work
- A practical and provably secure coalition-resistant group signature scheme
- A threshold cryptosystem without a trusted party. (Extended abstract)
- A verifiable secret shuffle of homomorphic encryptions
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- Advances in cryptology -- EUROCRYPT 2004. International conference on the theory and applications of cryptographic techniques, Interlaken, Switzerland, May 2--6, 2004. Proceedings.
- An efficient scheme for proving a shuffle
- Compact E-Cash
- Fair blind signatures
- Foundations of group signatures: Formal definitions, simplified requirements, and a construction based on general assumptions
- Group signatures
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- How to share a secret
- scientific article; zbMATH DE number 3825707 (Why is no real title available?)
- Privacy preserving data mining
- Privacy preserving data mining
- Privacy-Preserving Set Operations
- Secure distributed key generation for discrete-log based cryptosystems
- Securing threshold cryptosystems against chosen ciphertext attack
- Short group signatures
- Unclonable Group Identification
This page was built for publication: Privacy Preserving Data Mining within Anonymous Credential Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3540036)