Privacy Preserving Data Mining within Anonymous Credential Systems
From MaRDI portal
Recommendations
Cites work
- A Verifiable Secret Shuffe 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.
- Advances in Cryptology – CRYPTO 2004
- Compact E-Cash
- Group Signatures
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- How to share a secret
- scientific article; zbMATH DE number 1676644 (Why is no real title available?)
- scientific article; zbMATH DE number 3825707 (Why is no real title available?)
- scientific article; zbMATH DE number 177618 (Why is no real title available?)
- scientific article; zbMATH DE number 1304079 (Why is no real title available?)
- scientific article; zbMATH DE number 2009983 (Why is no real title available?)
- scientific article; zbMATH DE number 1759770 (Why is no real title available?)
- scientific article; zbMATH DE number 1759783 (Why is no real title available?)
- scientific article; zbMATH DE number 1842502 (Why is no real title available?)
- Privacy preserving data mining
- Privacy-Preserving Set Operations
- Securing threshold cryptosystems against chosen ciphertext attack
- 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)