| P50 | author | Eike Kiltz | Q1303757 |
| P2093 | author name string | Dennis Hofheinz | |
| | Victor Shoup | |
| P2860 | cites work | Efficient Selective-ID Secure Identity-Based Encryption Without Random Oracles | Q56017369 |
| | Nonmalleable Cryptography | Q56113985 |
| | A Twist on the Naor-Yung Paradigm and Its Application to Efficient CCA-Secure Encryption from Hard Search Problems | Q59163699 |
| | Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model | Q59163711 |
| | A New Randomness Extraction Paradigm for Hybrid Encryption | Q59163714 |
| | Practical Chosen Ciphertext Secure Encryption from Factoring | Q59163726 |
| | The Twin Diffie–Hellman Problem and Applications | Q59163734 |
| | The Twin Diffie-Hellman Problem and Applications | Q59163753 |
| | Chosen-Ciphertext Secure Key-Encapsulation Based on Gap Hashed Diffie-Hellman | Q59163759 |
| | Secure Hybrid Encryption from Weakened Key Encapsulation | Q59163762 |
| | Chosen-Ciphertext Security from Tag-Based Encryption | Q59163769 |
| | Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack | Q21721409 |
| | Chosen ciphertext attacks against protocols based on the RSA encryption standard PKCS #1 | Q21722642 |
| | Probabilistic encryption | Q30051773 |
| | How to Generate Cryptographically Strong Sequences of Pseudorandom Bits | Q55918694 |
| | A Simple Unpredictable Pseudo-Random Number Generator | Q55951424 |
| | A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks | Q55954461 |
| P433 | issue | 1 | |
| P407 | language of work or name | English | Q1860 |
| P6104 | maintained by WikiProject | WikiProject Mathematics | Q8487137 |
| P304 | page(s) | 102-118 | |
| P577 | publication date | 2011-12-20 | |
| P1433 | published in | Journal of Cryptology | Q743119 |
| P1476 | title | Practical Chosen Ciphertext Secure Encryption from Factoring | |
| P478 | volume | 26 | |