| 2018 | More Efficient Commitments from Structured Lattice Assumptions. | Carsten Baum, Ivan Damgrd, Vadim Lyubashevsky, Sabine Oechsner, Chris Peikert |
| 2018 | A Constructive Perspective on Signcryption Security. | Christian Badertscher, Fabio Banfi, Ueli Maurer |
| 2018 | Estimate All the {LWE, NTRU} Schemes! | Martin R. Albrecht, Benjamin R. Curtis, Amit Deo, Alex Davidson, Rachel Player, Eamonn W. Postlethwaite, Fernando Virdia, Thomas Wunderer |
| 2018 | Lower Bounds on Structure-Preserving Signatures for Bilateral Messages. | Masayuki Abe, Miguel Ambrona, Miyako Ohkubo, Mehdi Tibouchi |
| 2016 | Signatures Resilient to Uninvertible Leakage. | Yuyu Wang, Takahiro Matsuda, Goichiro Hanaoka, Keisuke Tanaka |
| 2016 | Efficient Asynchronous Accumulators for Distributed PKI. | Leonid Reyzin, Sophia Yakoubov |
| 2016 | The Whole is Less Than the Sum of Its Parts: Constructing More Efficient Lattice-Based AKEs. | Rafal del Pino, Vadim Lyubashevsky, David Pointcheval |
| 2016 | How (Not) to Instantiate Ring-LWE. | Chris Peikert |
| 2016 | Fiat-Shamir for Highly Sound Protocols Is Instantiable. | Arno Mittelbach, Daniele Venturi |
| 2016 | Bounded KDM Security from iO and OWF. | Antonio Marcedone, Rafael Pass, Abhi Shelat |
| 2016 | A Tag Based Encoding: An Efficient Encoding for Predicate Encryption in Prime Order Groups. | Jongkil Kim, Willy Susilo, Fuchun Guo, Man Ho Au |
| 2016 | High-Precision Secure Computation of Satellite Collision Probabilities. | Brett Hemenway, Steve Lu, Rafail Ostrovsky, William Welser IV |
| 2016 | The Feasibility of Outsourced Database Search in the Plain Model. | Carmit Hazay, Hila Zarosim |
| 2016 | What Security Can We Achieve Within 4 Rounds? | Carmit Hazay, Muthuramakrishnan Venkitasubramaniam |
| 2016 | A Unified Approach to Idealized Model Separations via Indistinguishability Obfuscation. | Matthew D. Green, Jonathan Katz, Alex J. Malozemoff, Hong-Sheng Zhou |
| 2016 | Zero-Knowledge Made Easy so It Won't Make You Dizzy - (A Tale of Transaction Put in Verse About an Illicit Kind of Commerce). | Trotta Gnam |
| 2016 | Verifiable Zero-Knowledge Order Queries and Updates for Fully Dynamic Lists and Trees. | Esha Ghosh, Michael T. Goodrich, Olga Ohrimenko, Roberto Tamassia |
| 2016 | Improving Practical UC-Secure Commitments Based on the DDH Assumption. | Eiichiro Fujisaki |
| 2016 | Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions. | Georg Fuchsbauer, Christian Hanser, Chethan Kamath, Daniel Slamanig |
| 2016 | Proactive Secret Sharing with a Dishonest Majority. | Shlomi Dolev, Karim El Defrawy, Joshua Lampkins, Rafail Ostrovsky, Moti Yung |
| 2016 | On the Implausibility of Constant-Round Public-Coin Zero-Knowledge Proofs. | Yi Deng, Juan A. Garay, San Ling, Huaxiong Wang, Moti Yung |
| 2016 | On Adaptively Secure Multiparty Computation with a Short CRS. | Ran Cohen, Chris Peikert |
| 2016 | Linear Overhead Optimally-Resilient Robust MPC Using Preprocessing. | Ashish Choudhury, Emmanuela Orsini, Arpita Patra, Nigel P. Smart |
| 2016 | Non-zero Inner Product Encryption with Short Ciphertexts and Private Keys. | Jie Chen, Benot Libert, Somindu C. Ramanna |
| 2016 | Verifiable Pattern Matching on Outsourced Texts. | Dario Catalano, Mario Di Raimondo, Simone Faro |