Abstract is missing.
- MQ MQ -Based Signatures in the QROMMing-Shing Chen, Andreas Hülsing, Joost Rijneveld, Simona Samardjiska, Peter Schwabe. 3-33 [doi]
- A Unified Framework for Trapdoor-Permutation-Based Sequential Aggregate SignaturesCraig Gentry, Adam O'Neill, Leonid Reyzin. 34-57 [doi]
- Constant-Size Group Signatures from LatticesSan Ling, Khoa Nguyen, Huaxiong Wang, Yanhong Xu. 58-88 [doi]
- Attribute-Based Signatures for Unbounded Circuits in the ROM and Efficient Instantiations from LatticesAli El Kaafarani, Shuichi Katsumata. 89-119 [doi]
- Improved (Almost) Tightly-Secure Structure-Preserving SignaturesCharanjit S. Jutla, Miyako Ohkubo, Arnab Roy 0003. 123-152 [doi]
- Weakly Secure Equivalence-Class Signatures from Standard AssumptionsGeorg Fuchsbauer, Romain Gay. 153-183 [doi]
- Simple and Generic Constructions of Succinct Functional EncryptionFuyuki Kitagawa, Ryo Nishimaki, Keisuke Tanaka. 187-217 [doi]
- Making Public Key Functional Encryption Function Private, DistributivelyXiong Fan, Qiang Tang 0005. 218-244 [doi]
- Full-Hiding (Unbounded) Multi-input Inner Product Functional Encryption from the k-Linear AssumptionPratish Datta, Tatsuaki Okamoto, Junichi Tomida. 245-277 [doi]
- Local Non-malleable Codes in the Bounded Retrieval ModelDana Dachman-Soled, Mukul Kulkarni, Aria Shahverdi. 281-311 [doi]
- Non-malleability vs. CCA-Security: The Case of CommitmentsBrandon Broadnax, Valerie Fetzer, Jörn Müller-Quade, Andy Rupp. 312-337 [doi]
- Interactively Secure Groups from ObfuscationThomas Agrikola, Dennis Hofheinz. 341-370 [doi]
- Graded Encoding Schemes from ObfuscationPooya Farshim, Julia Hesse, Dennis Hofheinz, Enrique Larraia. 371-400 [doi]
- Hashing Solutions Instead of Generating Problems: On the Interactive Certification of RSA ModuliBenedikt Auerbach, Bertram Poettering. 403-430 [doi]
- Two-Factor Authentication with End-to-End Password SecurityStanislaw Jarecki, Hugo Krawczyk, Maliheh Shirvanian, Nitesh Saxena. 431-461 [doi]
- Bootstrapping the Blockchain, with Applications to Consensus and Fast PKI SetupJuan A. Garay, Aggelos Kiayias, Nikos Leonardos, Giorgos Panagiotakos. 465-495 [doi]
- Efficient Adaptively Secure Zero-Knowledge from Garbled CircuitsChaya Ganesh, Yashvanth Kondi, Arpita Patra, Pratik Sarkar. 499-529 [doi]
- Compact Zero-Knowledge Proofs of Small Hamming WeightIvan Damgård, Ji Luo, Sabine Oechsner, Peter Scholl, Mark Simkin. 530-560 [doi]
- Efficient Batch Zero-Knowledge Arguments for Low Degree PolynomialsJonathan Bootle, Jens Groth. 561-588 [doi]
- On the Security of Classic Protocols for Unique Witness RelationsYi Deng, Xuyang Song, Jingyue Yu, Yu Chen 0003. 589-615 [doi]
- New (and Old) Proof Systems for Lattice ProblemsNavid Alamati, Chris Peikert, Noah Stephens-Davidowitz. 619-643 [doi]
- Hash Proof Systems over Lattices RevisitedFabrice Benhamouda, Olivier Blazy, Léo Ducas, Willy Quach. 644-674 [doi]
- Privately Constraining and Programming PRFs, the LWE WayChris Peikert, Sina Shiehian. 675-701 [doi]
- Learning with Errors and Extrapolated Dihedral CosetsZvika Brakerski, Elena Kirshanova, Damien Stehlé, Weiqiang Wen. 702-727 [doi]
- Rounded Gaussians - Fast and Secure Constant-Time Sampling for Lattice-Based CryptoAndreas Hülsing, Tanja Lange 0001, Kit Smeets. 728-757 [doi]