Towards restricting plaintext space in public key encryption
From MaRDI portal
Publication:3098005
Recommendations
Cites work
- scientific article; zbMATH DE number 1583789 (Why is no real title available?)
- scientific article; zbMATH DE number 1162684 (Why is no real title available?)
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Constant-Size Dynamic k-TAA
- Efficient proofs that a committed number lies in an interval
- Homomorphic Encryption and Signatures from Vector Decomposition
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Probabilistic encryption
- Proofs on Encrypted Values in Bilinear Groups and an Application to Anonymity of Signatures
- Revocable Group Signature Schemes with Constant Costs for Signing and Verifying
- Short signatures without random oracles and the SDH assumption in bilinear groups
- Theory of Cryptography
- k-Times Anonymous Authentication (Extended Abstract)
Cited in
(4)
This page was built for publication: Towards restricting plaintext space in public key encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3098005)