Towards restricting plaintext space in public key encryption
From MaRDI portal
Publication:3098005
DOI10.1007/978-3-642-25141-2_13zbMATH Open1344.94071OpenAlexW46492247MaRDI QIDQ3098005FDOQ3098005
Yusuke Sakai, Goichiro Hanaoka, Kazumasa Omote, Keita Emura, Yutaka Kawai
Publication date: 10 November 2011
Published in: Advances in Information and Computer Security (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-25141-2_13
Recommendations
Cites Work
- Probabilistic encryption
- Theory of Cryptography
- Short signatures without random oracles and the SDH assumption in bilinear groups
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Advances in Cryptology - EUROCRYPT 2004
- Title not available (Why is that?)
- Proofs on Encrypted Values in Bilinear Groups and an Application to Anonymity of Signatures
- Advances in Cryptology – CRYPTO 2004
- Constant-Size Dynamic k-TAA
- Advances in Cryptology - CRYPTO 2003
- Homomorphic Encryption and Signatures from Vector Decomposition
- k-Times Anonymous Authentication (Extended Abstract)
- Efficient proofs that a committed number lies in an interval
- Title not available (Why is that?)
- Revocable Group Signature Schemes with Constant Costs for Signing and Verifying
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)