Abstract is missing.
- A Tag Based Encoding: An Efficient Encoding for Predicate Encryption in Prime Order GroupsJongkil Kim, Willy Susilo, Fuchun Guo, Man Ho Au. 3-22 [doi]
- Non-zero Inner Product Encryption with Short Ciphertexts and Private KeysJie Chen, Benoît Libert, Somindu C. Ramanna. 23-41 [doi]
- Attribute-Based Encryption for Range AttributesNuttapong Attrapadung, Goichiro Hanaoka, Kazuto Ogawa, Go Ohtake, Hajime Watanabe, Shota Yamada 0001. 42-61 [doi]
- Naor-Yung Paradigm with Shared Randomness and ApplicationsSilvio Biagioni, Daniel Masny, Daniele Venturi. 62-80 [doi]
- Provably-Secure Remote Memory Attestation for Heap Overflow ProtectionAlexandra Boldyreva, Taesoo Kim, Richard J. Lipton, Bogdan Warinschi. 83-103 [doi]
- Memory Erasability AmplificationJan Camenisch, Robert R. Enderlein, Ueli Maurer. 104-125 [doi]
- On Adaptively Secure Multiparty Computation with a Short CRSRan Cohen, Chris Peikert. 129-146 [doi]
- Linear Overhead Optimally-Resilient Robust MPC Using PreprocessingAshish Choudhury, Emmanuela Orsini, Arpita Patra, Nigel P. Smart. 147-168 [doi]
- High-Precision Secure Computation of Satellite Collision ProbabilitiesBrett Hemenway, Steve Lu, Rafail Ostrovsky, William Welser IV. 169-187 [doi]
- 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. 191-197 [doi]
- Fiat-Shamir for Highly Sound Protocols Is InstantiableArno Mittelbach, Daniele Venturi. 198-215 [doi]
- Verifiable Zero-Knowledge Order Queries and Updates for Fully Dynamic Lists and TreesEsha Ghosh, Michael T. Goodrich, Olga Ohrimenko, Roberto Tamassia. 216-236 [doi]
- On the Implausibility of Constant-Round Public-Coin Zero-Knowledge ProofsYi Deng, Juan A. Garay, San Ling, Huaxiong Wang, Moti Yung. 237-253 [doi]
- Improving Practical UC-Secure Commitments Based on the DDH AssumptionEiichiro Fujisaki. 257-272 [doi]
- The Whole is Less Than the Sum of Its Parts: Constructing More Efficient Lattice-Based AKEsRafaël Del Pino, Vadim Lyubashevsky, David Pointcheval. 273-291 [doi]
- Efficient Asynchronous Accumulators for Distributed PKILeonid Reyzin, Sophia Yakoubov. 292-309 [doi]
- The Feasibility of Outsourced Database Search in the Plain ModelCarmit Hazay, Hila Zarosim. 313-332 [doi]
- Verifiable Pattern Matching on Outsourced TextsDario Catalano, Mario Di Raimondo, Simone Faro. 333-350 [doi]
- Virtual Smart Cards: How to Sign with a Password and a ServerJan Camenisch, Anja Lehmann, Gregory Neven, Kai Samelin. 353-371 [doi]
- Signatures Resilient to Uninvertible LeakageYuyu Wang, Takahiro Matsuda 0002, Goichiro Hanaoka, Keisuke Tanaka. 372-390 [doi]
- Practical Round-Optimal Blind Signatures in the Standard Model from Weaker AssumptionsGeorg Fuchsbauer, Christian Hanser, Chethan Kamath, Daniel Slamanig. 391-408 [doi]
- How (Not) to Instantiate Ring-LWEChris Peikert. 411-430 [doi]
- Pen and Paper Arguments for SIMON and SIMON-like DesignsChristof Beierle. 431-446 [doi]
- Bounded Size-Hiding Private Set IntersectionTatiana Bradley, Sky Faber, Gene Tsudik. 449-467 [doi]
- On Garbling Schemes with and Without PrivacyCarsten Baum. 468-485 [doi]
- What Security Can We Achieve Within 4 Rounds?Carmit Hazay, Muthuramakrishnan Venkitasubramaniam. 486-505 [doi]
- Secret Sharing Schemes for Dense Forbidden GraphsAmos Beimel, Oriol Farràs, Naty Peter. 509-528 [doi]
- Proactive Secret Sharing with a Dishonest MajorityShlomi Dolev, Karim El Defrawy, Joshua Lampkins, Rafail Ostrovsky, Moti Yung. 529-548 [doi]
- Shorter Circuit Obfuscation in Challenging Security ModelsZvika Brakerski, Or Dagmi. 551-570 [doi]
- Bounded KDM Security from iO and OWFAntonio Marcedone, Rafael Pass, Abhi Shelat. 571-586 [doi]
- A Unified Approach to Idealized Model Separations via Indistinguishability ObfuscationMatthew D. Green, Jonathan Katz, Alex J. Malozemoff, Hong-Sheng Zhou. 587-603 [doi]