| Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions D Micciancio, P Mol Advances in Cryptology–CRYPTO 2011: 31st Annual Cryptology Conference, Santa …, 2011 | 192 | 2011 |
| Chosen-ciphertext security from slightly lossy trapdoor functions P Mol, S Yilek Public Key Cryptography–PKC 2010: 13th International Conference on Practice …, 2010 | 58 | 2010 |
| The tree ensemble layer: Differentiability meets conditional computation H Hazimeh, N Ponomareva, P Mol, Z Tan, R Mazumder International Conference on Machine Learning, 4138-4148, 2020 | 46 | 2020 |
| Recovering NTRU secret key from inversion oracles P Mol, M Yung Lecture Notes in Computer Science 4939, 18-36, 2008 | 24 | 2008 |
| Secret-key authentication beyond the challenge-response paradigm: Definitional issues and new protocols P Mol, S Tessaro Manuscript, December, 2012 | 3 | 2012 |
| The Effects of Diversity in Aggregation Games. P Mol, A Vattani, P Voulgaris ICS, 509-521, 2011 | 2 | 2011 |
| Lattices and their Applications to RSA Cryptosystem. P Mol National Technical University of Athens, Department of Electrical and …, 2006 | 1 | 2006 |
| Throughput/Fairness Trade offs for the iSLIP Scheduling Algorithm P Mol, T Ristov, N Trogkanis | 1 | |
| Improving Cryptographic Constructions Using Coding Theory P Mol University of California, San Diego, 2013 | | 2013 |
| Whom Are You Chatting With? P Voulgaris, P Mol, A Vattani | | 2008 |
| Lattices and Cryptography: An Overview of Recent Results with Emphasis on RSA and NTRU Cryptosystems. P Mol | | 2006 |
| Leakage-Resilient Cryptography: A Survey of Recent Advances P Mol | | |
