PA in the Two-Key Setting and a Generic Conversion for Encryption with Anonymity
From MaRDI portal
Publication:5757697
DOI10.1007/11780656_23zbMATH Open1176.94041OpenAlexW1525155900MaRDI QIDQ5757697FDOQ5757697
Authors: Ryotaro Hayashi, Keisuke Tanaka
Publication date: 7 September 2007
Published in: Information Security and Privacy (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11780656_23
Recommendations
- scientific article; zbMATH DE number 2081087
- Anonymity from Public Key Encryption to Undeniable Signatures
- Building Key-Private Public-Key Encryption Schemes
- Towards Plaintext-Aware Public-Key Encryption Without Random Oracles
- Relationship Between Standard Model Plaintext Awareness and Message Hiding
Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)
Cited In (6)
- Anonymity on Paillier’s Trap-Door Permutation
- Relationship between Two Approaches for Defining the Standard Model PA-ness
- Building Key-Private Public-Key Encryption Schemes
- Anonymous, robust post-quantum public key encryption
- One-time encryption-key technique for the traditional DL-based encryption scheme with anonymity
- Universally Anonymizable Public-Key Encryption
This page was built for publication: PA in the Two-Key Setting and a Generic Conversion for Encryption with Anonymity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5757697)