Abstract is missing.
- Nonlinear Invariant Attack - Practical Attack on Full SCREAM, iSCREAM, and Midori64Yosuke Todo, Gregor Leander, Yu Sasaki. 3-33 [doi]
- Cliptography: Clipping the Power of Kleptographic AttacksAlexander Russell, Qiang Tang 0005, Moti Yung, Hong-Sheng Zhou. 34-64 [doi]
- Zero-Knowledge Accumulators and Set AlgebraEsha Ghosh, Olga Ohrimenko, Dimitrios Papadopoulos, Roberto Tamassia, Nikos Triandopoulos. 67-100 [doi]
- Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group EncryptionBenoît Libert, San Ling, Fabrice Mouhartem, Khoa Nguyen, Huaxiong Wang. 101-131 [doi]
- MQ -Based SignaturesMing-Shing Chen, Andreas Hülsing, Joost Rijneveld, Simona Samardjiska, Peter Schwabe. 135-165 [doi]
- Collapse-Binding Quantum Commitments Without Random OraclesDominique Unruh. 166-195 [doi]
- Digital Signatures Based on the Hardness of Ideal Lattice Problems in All RingsVadim Lyubashevsky. 196-214 [doi]
- Adaptive Oblivious Transfer and GeneralizationOlivier Blazy, Céline Chevalier, Paul Germouty. 217-247 [doi]
- Selective Opening Security from Simulatable Data EncapsulationFelix Heuer, Bertram Poettering. 248-277 [doi]
- Selective-Opening Security in the Presence of Randomness FailuresViet Tung Hoang, Jonathan Katz, Adam O'Neill, Mohammad-Zaheri. 278-306 [doi]
- Efficient KDM-CCA Secure Public-Key Encryption for Polynomial FunctionsShuai Han, Shengli Liu, Lin Lyu. 307-338 [doi]
- Structure-Preserving Smooth Projective HashingOlivier Blazy, Céline Chevalier. 339-369 [doi]
- Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice AssumptionsBenoît Libert, San Ling, Fabrice Mouhartem, Khoa Nguyen, Huaxiong Wang. 373-403 [doi]
- Towards Tightly Secure Lattice Short Signature and Id-Based EncryptionXavier Boyen, Qinyi Li. 404-434 [doi]
- From Identification to Signatures, Tightly: A Framework and Generic TransformsMihir Bellare, Bertram Poettering, Douglas Stebila. 435-464 [doi]
- How to Obtain Fully Structure-Preserving (Automorphic) Signatures from Structure-Preserving OnesYuyu Wang, Zongyang Zhang, Takahiro Matsuda 0002, Goichiro Hanaoka, Keisuke Tanaka. 465-495 [doi]
- Multi-key Homomorphic AuthenticatorsDario Fiore, Aikaterini Mitrokotsa, Luca Nizzardo, Elena Pagnin. 499-530 [doi]
- Multi-input Functional Encryption with Unbounded-Message SecurityVipul Goyal, Aayush Jain, Adam O'Neill. 531-556 [doi]
- Verifiable Functional EncryptionSaikrishna Badrinarayanan, Vipul Goyal, Aayush Jain, Amit Sahai. 557-587 [doi]
- Dual System Encryption Framework in Prime-Order Groups via Computational Pair EncodingsNuttapong Attrapadung. 591-623 [doi]
- Efficient IBE with Tight Reduction to Standard Assumption in the Multi-challenge SettingJunqing Gong, Xiaolei Dong, Jie Chen 0021, Zhenfu Cao. 624-654 [doi]
- Déjà Q All Over Again: Tighter and Broader Reductions of q-Type AssumptionsMelissa Chase, Mary Maller, Sarah Meiklejohn. 655-681 [doi]
- Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear MapsShuichi Katsumata, Shota Yamada 0001. 682-712 [doi]
- How to Generate and Use Universal SamplersDennis Hofheinz, Tibor Jager, Dakshita Khurana, Amit Sahai, Brent Waters, Mark Zhandry. 715-744 [doi]
- Iterated Random Oracle: A Universal Approach for Finding Loss in Security ReductionFuchun Guo, Willy Susilo, Yi Mu, Rongmao Chen, Jianchang Lai, Guomin Yang. 745-776 [doi]
- NIZKs with an Untrusted CRS: Security in the Face of Parameter SubversionMihir Bellare, Georg Fuchsbauer, Alessandra Scafuro. 777-804 [doi]
- Universal Composition with Responsive EnvironmentsJan Camenisch, Robert R. Enderlein, Stephan Krenn, Ralf Küsters, Daniel Rausch 0001. 807-840 [doi]
- A Shuffle Argument Secure in the Generic ModelPrastudy Fauzi, Helger Lipmaa, Michal Zajac. 841-872 [doi]
- Efficient Public-Key Distance Bounding ProtocolHandan Kilinç, Serge Vaudenay. 873-901 [doi]
- Indistinguishable Proofs of Work or KnowledgeFoteini Baldimtsi, Aggelos Kiayias, Thomas Zacharias 0001, Bingsheng Zhang. 902-933 [doi]
- Size-Hiding Computation for Multiple PartiesKazumasa Shinagawa, Koji Nuida, Takashi Nishide, Goichiro Hanaoka, Eiji Okamoto. 937-966 [doi]
- How to Circumvent the Two-Ciphertext Lower Bound for Linear Garbling SchemesCarmen Kempka, Ryo Kikuchi, Koutarou Suzuki. 967-997 [doi]
- Constant-Round Asynchronous Multi-Party Computation Based on One-Way FunctionsSandro Coretti, Juan A. Garay, Martin Hirt, Vassilis Zikas. 998-1021 [doi]
- Reactive Garbling: Foundation, Instantiation, ApplicationJesper Buus Nielsen, Samuel Ranellucci. 1022-1052 [doi]