Abstract is missing.
- Improved Security Proofs in Lattice-Based Cryptography: Using the Rényi Divergence Rather Than the Statistical DistanceShi Bai, Adeline Langlois, Tancrède Lepoint, Damien Stehlé, Ron Steinfeld. 3-24 [doi]
- Multi-input Functional Encryption for Unbounded Arity FunctionsSaikrishna Badrinarayanan, Divya Gupta 0001, Abhishek Jain 0002, Amit Sahai. 27-51 [doi]
- Multi-party Key Exchange for Unbounded Parties from Indistinguishability ObfuscationDakshita Khurana, Vanishree Rao, Amit Sahai. 52-75 [doi]
- Adaptively Secure Puncturable Pseudorandom Functions in the Standard ModelSusan Hohenberger, Venkata Koppula, Brent Waters. 79-102 [doi]
- Multilinear and Aggregate Pseudorandom Functions: New Constructions and Improved SecurityMichel Abdalla, Fabrice Benhamouda, Alain Passelègue. 103-120 [doi]
- New Realizations of Somewhere Statistically Binding Hashing and Positional AccumulatorsTatsuaki Okamoto, Krzysztof Pietrzak, Brent Waters, Daniel Wichs. 121-145 [doi]
- Computing Individual Discrete Logarithms Faster in GF(p n ) with the NFS-DL AlgorithmAurore Guillevic. 149-173 [doi]
- Multiple Discrete Logarithm Problems with Auxiliary InputsTaechan Kim. 174-188 [doi]
- Solving Linear Equations Modulo Unknown Divisors: RevisitedYao Lu, Rui Zhang 0002, Liqiang Peng, Dongdai Lin. 189-213 [doi]
- Fourℚ: Four-Dimensional Decompositions on a ℚ-curve over the Mersenne PrimeCraig Costello, Patrick Longa. 214-235 [doi]
- Efficient Fully Structure-Preserving Signatures for Large MessagesJens Groth. 239-259 [doi]
- A Provably Secure Group Signature Scheme from Code-Based AssumptionsMartianus Frederic Ezerman, Hyung Tae Lee, San Ling, Khoa Nguyen, Huaxiong Wang. 260-285 [doi]
- Type 2 Structure-Preserving Signature Schemes RevisitedSanjit Chatterjee, Alfred Menezes. 286-310 [doi]
- Design Principles for HFEv- Based Multivariate Signature SchemesAlbrecht Petzoldt, Ming-Shing Chen, Bo-Yin Yang, Chengdong Tao, Jintai Ding. 311-334 [doi]
- Oblivious Network RAM and Leveraging Parallelism to Achieve ObliviousnessDana Dachman-Soled, Chang Liu, Charalampos Papamanthou, Elaine Shi, Uzi Vishkin. 337-359 [doi]
- Three-Party ORAM for Secure ComputationSky Faber, Stanislaw Jarecki, Sotirios Kentros, Boyang Wei. 360-385 [doi]
- On Cut-and-Choose Oblivious Transfer and Its VariantsVladimir Kolesnikov, Ranjit Kumaresan. 386-412 [doi]
- An Asymptotically Optimal Method for Converting Bit Encryption to Multi-Bit EncryptionTakahiro Matsuda 0002, Goichiro Hanaoka. 415-442 [doi]
- Selective Opening Security for ReceiversCarmit Hazay, Arpita Patra, Bogdan Warinschi. 443-469 [doi]
- Function-Hiding Inner Product EncryptionAllison Bishop, Abhishek Jain 0002, Lucas Kowalczyk. 470-491 [doi]
- Idealizing Identity-Based EncryptionDennis Hofheinz, Christian Matt 0002, Ueli Maurer. 495-520 [doi]
- A Framework for Identity-Based Encryption with Almost Tight SecurityNuttapong Attrapadung, Goichiro Hanaoka, Shota Yamada 0001. 521-549 [doi]
- Riding on Asymmetry: Efficient ABE for Branching ProgramsSergey Gorbunov, Dhinakaran Vinayagamurthy. 550-574 [doi]
- Conversions Among Several Classes of Predicate Encryption and Applications to ABE with Various Compactness TradeoffsNuttapong Attrapadung, Goichiro Hanaoka, Shota Yamada 0001. 575-601 [doi]
- QA-NIZK Arguments in Asymmetric Groups: New Tools and New ConstructionsAlonso-González, Alejandro Hevia, Carla Ràfols. 605-629 [doi]
- Dual-System Simulation-Soundness with Applications to UC-PAKE and MoreCharanjit S. Jutla, Arnab Roy 0003. 630-655 [doi]
- Secret Sharing and Statistical Zero KnowledgeVinod Vaikuntanathan, Prashant Nalini Vasudevan. 656-680 [doi]
- Compactly Hiding Linear Spans - Tightly Secure Constant-Size Simulation-Sound QA-NIZK Proofs and ApplicationsBenoît Libert, Thomas Peters, Marc Joye, Moti Yung. 681-707 [doi]
- A Unified Approach to MPC with Preprocessing Using OTTore Kasper Frederiksen, Marcel Keller, Emmanuela Orsini, Peter Scholl. 711-735 [doi]
- Secure Computation from MillionaireAbhi Shelat, Muthuramakrishnan Venkitasubramaniam. 736-757 [doi]
- Garbling Scheme for Formulas with Constant Size of Garbled GatesCarmen Kempka, Ryo Kikuchi, Susumu Kiyoshima, Koutarou Suzuki. 758-782 [doi]
- Card-Based Cryptographic Protocols Using a Minimal Number of CardsAlexander Koch, Stefan Walzer, Kevin Härtel. 783-807 [doi]