Abstract is missing.
- BKZ 2.0: Better Lattice Security EstimatesYuanmi Chen, Phong Q. Nguyen. 1-20 [doi]
- Functional Encryption for Inner Product Predicates from Learning with ErrorsShweta Agrawal, David Mandell Freeman, Vinod Vaikuntanathan. 21-40 [doi]
- Random Oracles in a Quantum WorldDan Boneh, Özgür Dagdelen, Marc Fischlin, Anja Lehmann, Christian Schaffner, Mark Zhandry. 41-69 [doi]
- Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext SecurityBrett Hemenway, Benoît Libert, Rafail Ostrovsky, Damien Vergnaud. 70-88 [doi]
- Structure Preserving CCA Secure Encryption and ApplicationsJan Camenisch, Kristiyan Haralambiev, Markulf Kohlweiss, Jorn Lapon, Vincent Naessens. 89-106 [doi]
- Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$Alexander May, Alexander Meurer, Enrico Thomae. 107-124 [doi]
- Lower and Upper Bounds for Deniable Public-Key EncryptionRikke Bendlin, Jesper Buus Nielsen, Peter Sebastian Nordholt, Claudio Orlandi. 125-142 [doi]
- Bridging Broadcast Encryption and Group Key AgreementQianhong Wu, Bo Qin, Lei Zhang 0009, Josep Domingo-Ferrer, Oriol Farràs. 143-160 [doi]
- On the Joint Security of Encryption and Signature, RevisitedKenneth G. Paterson, Jacob C. N. Schuldt, Martijn Stam, Susan Thomson 0001. 161-178 [doi]
- Polly Cracker, RevisitedMartin R. Albrecht, Pooya Farshim, Jean-Charles Faugère, Ludovic Perret. 179-196 [doi]
- Oblivious RAM with O((logN)3) Worst-Case CostElaine Shi, T.-H. Hubert Chan, Emil Stefanov, Mingfei Li. 197-214 [doi]
- Noiseless Database PrivacyRaghav Bhaskar, Abhishek Bhowmick, Vipul Goyal, Srivatsan Laxman, Abhradeep Thakurta. 215-232 [doi]
- The Preimage Security of Double-Block-Length Compression FunctionsFrederik Armknecht, Ewan Fleischmann, Matthias Krause, Jooyoung Lee, Martijn Stam, John P. Steinberger. 233-251 [doi]
- Rebound Attack on JH42María Naya-Plasencia, Deniz Toz, Kerem Varici. 252-269 [doi]
- Second-Order Differential Collisions for Reduced SHA-256Alex Biryukov, Mario Lamberger, Florian Mendel, Ivica Nikolic. 270-287 [doi]
- Finding SHA-2 Characteristics: Searching through a Minefield of ContradictionsFlorian Mendel, Tomislav Nad, Martin Schläffer. 288-307 [doi]
- Cryptanalysis of ARMADILLO2Mohamed Ahmed Abdelraheem, Céline Blondeau, María Naya-Plasencia, Marion Videau, Erik Zenner. 308-326 [doi]
- An Experimentally Verified Attack on Full Grain-128 Using Dedicated Reconfigurable HardwareItai Dinur, Tim Güneysu, Christof Paar, Adi Shamir, Ralf Zimmermann 0001. 327-343 [doi]
- Biclique Cryptanalysis of the Full AESAndrey Bogdanov, Dmitry Khovratovich, Christian Rechberger. 344-371 [doi]
- Tag Size Does Matter: Attacks and Proofs for the TLS Record ProtocolKenneth G. Paterson, Thomas Ristenpart, Thomas Shrimpton. 372-389 [doi]
- Resettable Cryptography in Constant Rounds - The Case of Zero KnowledgeYi Deng, Dengguo Feng, Vipul Goyal, Dongdai Lin, Amit Sahai, Moti Yung. 390-406 [doi]
- Two Provers in IsolationClaude Crépeau, Louis Salvail, Jean-Raymond Simard, Alain Tapp. 407-430 [doi]
- Efficient Zero-Knowledge Arguments from Two-Tiered Homomorphic CommitmentsJens Groth. 431-448 [doi]
- A Framework for Practical Universally Composable Zero-Knowledge ProtocolsJan Camenisch, Stephan Krenn, Victor Shoup. 449-467 [doi]
- Non-interactive and Re-usable Universally Composable String Commitments with Adaptive SecurityMarc Fischlin, Benoît Libert, Mark Manulis. 468-485 [doi]
- Cryptography Secure against Related-Key Attacks and TamperingMihir Bellare, David Cash, Rachel Miller. 486-503 [doi]
- Counting Points on Genus 2 Curves with Real MultiplicationPierrick Gaudry, David R. Kohel, Benjamin A. Smith. 504-519 [doi]
- On the Efficiency of Bit Commitment ReductionsSamuel Ranellucci, Alain Tapp, Severin Winkler, Jürg Wullschleger. 520-537 [doi]
- Secure Communication in Multicast GraphsQiushi Yang, Yvo Desmedt. 538-555 [doi]
- Constant-Round Private Function Evaluation with Linear ComplexityJonathan Katz, Lior Malka. 556-571 [doi]
- Constant-Rounds, Linear Multi-party Computation for Exponentiation and Modulo Reduction with Perfect SecurityChao Ning, Qiuliang Xu. 572-589 [doi]
- Computational Verifiable Secret Sharing RevisitedMichael Backes, Aniket Kate, Arpita Patra. 590-609 [doi]
- Natural Generalizations of Threshold Secret SharingOriol Farràs, Carles Padró, Chaoping Xing, an Yang. 610-627 [doi]
- Separating Short Structure-Preserving Signatures from Non-interactive AssumptionsMasayuki Abe, Jens Groth, Miyako Ohkubo. 628-646 [doi]
- Short Signatures from Weaker AssumptionsDennis Hofheinz, Tibor Jager, Eike Kiltz. 647-666 [doi]
- Practical Key-Recovery for All Possible Parameters of SFLASHCharles Bouillaguet, Pierre-Alain Fouque, Gilles Macario-Rat. 667-685 [doi]
- The Leakage-Resilience Limit of a Computational Problem Is Equal to Its Unpredictability EntropyDivesh Aggarwal, Ueli Maurer. 686-701 [doi]
- Leakage-Resilient Cryptography from the Inner-Product ExtractorStefan Dziembowski, Sebastian Faust. 702-721 [doi]
- Program Obfuscation with Leaky HardwareNir Bitansky, Ran Canetti, Shafi Goldwasser, Shai Halevi, Yael Tauman Kalai, Guy N. Rothblum. 722-739 [doi]
- BiTR: Built-in Tamper ResilienceSeung Geol Choi, Aggelos Kiayias, Tal Malkin. 740-758 [doi]