CRYPTO 2015:

Matthew J. B. Robshaw and Rosario Gennaro (Eds.):
Advances in Cryptology - CRYPTO 2015
35th Annual Cryptology Conference
Santa Barbara, CA, USA,
August 16-20, 2015, Proceedings

• Lattice-Based Cryptography
• Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing , 3-22, Thijs Laarhoven
  bib info
• Coded-BKW: Solving LWE Using Lattice Codes , 23-42, Thomas Johansson , Paul Stankovski , Qian Guo
  bib info
• An Improved BKW Algorithm for LWE with Applications to Cryptography and Lattices , 43-62, Pierre-Alain Fouque , Paul Kirchner
  bib info
• Provably Weak Instances of Ring-LWE , 63-92, Katherine E. Stange , Kristin E. Lauter , Yara Elias , Ekin Ozman
  bib info
• Cryptanalytic Insights
• Links Among Impossible Differential, Integral and Zero Correlation Linear Cryptanalysis , 95-115, Vincent Rijmen , Chao Li , Ruilin Li , Bing Sun , Hoda AlKhzaimi , Zhiqiang Liu , Qingju Wang , Lei Cheng
  bib info
• On Reverse-Engineering S-Boxes with Hidden Design Criteria or Structure , 116-140, Alex Biryukov , Léo Perrin
  bib info
• Capacity and Data Complexity in Multidimensional Linear Attack , 141-160, Serge Vaudenay , Xuejia Lai , Kaisa Nyberg , Jialin Huang
  bib info
• Observations on the SIMON Block Cipher Family , 161-185, Gregor Leander , Stefan Kölbl , Tyge Tiessen
  bib info
• Modes and Constructions
• Tweaking Even-Mansour Ciphers , 189-208, Yannick Seurin , Rodolphe Lampe , Benoit Cogliati
  bib info
• Multi-key Security: The Even-Mansour Construction Revisited , 209-223, Nicky Mouha , Atul Luykx
  bib info
• Reproducible Circularly-Secure Bit Encryption: Applications and Realizations , 224-243, Mohammad Hajiabadi , Bruce M. Kapron
  bib info
• Multilinear Maps and IO
• Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations , 247-266, Jean-Sébastien Coron , Shai Halevi , Craig Gentry , Amit Sahai , Hemanta K. Maji , Mehdi Tibouchi , Eric Miles , Mariana Raykova , Tancrède Lepoint
  bib info
• New Multilinear Maps Over the Integers , 267-286, Jean-Sébastien Coron , Mehdi Tibouchi , Tancrède Lepoint
  bib info
• Constant-Round Concurrent Zero-Knowledge from Indistinguishability Obfuscation , 287-307, Rafael Pass , Huijia Lin , Kai-Min Chung
  bib info
• Indistinguishability Obfuscation from Compact Functional Encryption , 308-326, Abhishek Jain , Prabhanjan Ananth
  bib info
• Pseudorandomness
• Efficient Pseudorandom Functions via On-the-Fly Adaptation , 329-350, Dominique Schröder , Nico Döttling
  bib info
• The Iterated Random Permutation Problem with Applications to Cascade Encryption , 351-367, Yannick Seurin , Brice Minaud
  bib info
• The Exact PRF Security of Truncation: Tight Bounds for Keyed Sponges and Truncated CBC , 368-387, Krzysztof Pietrzak , Stefano Tessaro , Peter Gazi
  bib info
• An Algebraic Framework for Pseudorandom Functions and Applications to Related-Key Security , 388-409, Michel Abdalla , Fabrice Benhamouda , Alain Passelègue
  bib info
• Block Cipher Cryptanalysis
• Integral Cryptanalysis on Full MISTY1 , 413-432, Yosuke Todo
  bib info
• New Attacks on Feistel Structures with Improved Memory Complexities , 433-454, Orr Dunkelman , Nathan Keller , Adi Shamir , Itai Dinur
  bib info
• Known-Key Distinguisher on Full PRESENT , 455-474, Thomas Peyrin , Lei Wang , Céline Blondeau
  bib info
• Key-Recovery Attack on the ASASA Cryptosystem with Expanding S-Boxes , 475-490, Henri Gilbert , Jérôme Plût , Joana Treger
  bib info
• Integrity
• Online Authenticated-Encryption and its Nonce-Reuse Misuse-Resistance , 493-517, Phillip Rogaway , Viet Tung Hoang , Reza Reyhanitabar , Damian Vizár
  bib info
• Relational Hash: Probabilistic Hash for Verifying Relations, Secure Against Forgery and More , 518-537, Arnab Roy , Avradip Mandal
  bib info
• Explicit Non-malleable Codes Against Bit-Wise Tampering and Permutations , 538-557, Manoj Prabhakaran , Omkant Pandey , Hemanta K. Maji , Shashank Agrawal , Divya Gupta
  bib info
• Assumptions
• Cryptanalysis of the Co-ACD Assumption , 561-580, Pierre-Alain Fouque , Moon Sung Lee , Mehdi Tibouchi , Tancrède Lepoint
  bib info
• Last Fall Degree, HFE, and Weil Descent Attacks on ECDLP , 581-600, Ming-Deh A. Huang , Michiel Kosters , Sze Ling Yeo
  bib info
• A Quasipolynomial Reduction for Generalized Selective Decryption on Trees , 601-620, Krzysztof Pietrzak , Georg Fuchsbauer , Zahra Jafargholi
  bib info
• Hash Functions and Stream Cipher Cryptanalysis
• Practical Free-Start Collision Attacks on 76-step SHA-1 , 623-642, Thomas Peyrin , Marc Stevens , Pierre Karpman
  bib info
• Fast Correlation Attacks over Extension Fields, Large-Unit Linear Approximation and Cryptanalysis of SNOW 2.0 , 643-662, Willi Meier , Bin Zhang , Chao Xu
  bib info
• Cryptanalysis of Full Sprout , 663-682, Mar#237;a Naya-Plasencia , Virginie Lallemand
  bib info
• Higher-Order Differential Meet-in-the-middle Preimage Attacks on SHA-1 and BLAKE , 683-701, Pierre-Alain Fouque , Pierre Karpman , Thomas Espitau
  bib info
• Implementations
• Decaf: Eliminating Cofactors Through Point Compression , 705-723, Mike Hamburg
  bib info
• Actively Secure OT Extension with Optimal Overhead , 724-741, Emmanuela Orsini , Marcel Keller , Peter Scholl
  bib info
• Algebraic Decomposition for Probing Security , 742-763, Claude Carlet , Emmanuel Prouff , Matthieu Rivain , Thomas Roche
  bib info
• Consolidating Masking Schemes , 764-783, Svetla Nikova , Ingrid Verbauwhede , Benedikt Gierlichs , Oscar Reparaz , Begül Bilgin
  bib info
• Multiparty Computation I
• A Simpler Variant of Universally Composable Security for Standard Multiparty Computation , 3-22, Ran Canetti , Yehuda Lindell , Asaf Cohen
  bib info
• Concurrent Secure Computation via Non-Black Box Simulation , 23-42, Vipul Goyal , Amit Sahai , Divya Gupta
  bib info
• Concurrent Secure Computation with Optimal Query Complexity , 43-62, Ran Canetti , Vipul Goyal , Abhishek Jain
  bib info
• Constant-Round MPC with Fairness and Guarantee of Output Delivery , 63-82, S. Dov Gordon , Elaine Shi , Feng-Hao Liu
  bib info
• Zero-Knowledge
• Statistical Concurrent Non-malleable Zero-Knowledge from One-Way Functions , 85-106, Susumu Kiyoshima
  bib info
• Implicit Zero-Knowledge Arguments and Applications to the Malicious Setting , 107-129, David Pointcheval , Hoeteck Wee , Fabrice Benhamouda , Geoffroy Couteau
  bib info
• Impossibility of Black-Box Simulation Against Leakage Attacks , 130-149, Giuseppe Persiano , Ivan Visconti , Rafail Ostrovsky
  bib info
• Efficient Zero-Knowledge Proofs of Non-algebraic Statements with Sublinear Amortized Cost , 150-169, Payman Mohassel , Mike Rosulek , Zhangxiang Hu
  bib info
• Theory
• Parallel Hashing via List Recoverability , 173-190, Ronen Shaltiel , Yuval Ishai , Iftach Haitner , Eran Omri
  bib info
• Cryptography with One-Way Communication , 191-208, Rafail Ostrovsky , Amit Sahai , Eyal Kushilevitz , Yuval Ishai , Sanjam Garg
  bib info
• (Almost) Optimal Constructions of UOWHFs from 1-to-1, Regular One-Way Functions and Beyond , 209-229, Dawu Gu , Jian Weng , Xiangxue Li , Yu Yu
  bib info
• Signatures
• Practical Round-Optimal Blind Signatures in the Standard Model , 233-253, Georg Fuchsbauer , Daniel Slamanig , Christian Hanser
  bib info
• Programmable Hash Functions Go Private: Constructions and Applications to (Homomorphic) Signatures with Shorter Public Keys , 254-274, Dario Catalano , Dario Fiore , Luca Nizzardo
  bib info
• Structure-Preserving Signatures from Standard Assumptions, Revisited , 275-295, Eike Kiltz , Hoeteck Wee , Jiaxin Pan
  bib info
• Short Group Signatures via Structure-Preserving Signatures: Standard Model Security from Simple Assumptions , 296-316, Benoît Libert , Moti Yung , Thomas Peters
  bib info
• Multiparty Computation II
• Efficient Constant Round Multi-party Computation Combining BMR and SPDZ , 319-338, Benny Pinkas , Nigel P. Smart , Yehuda Lindell , Avishay Yanai
  bib info
• Round-Optimal Black-Box Two-Party Computation , 339-358, Rafail Ostrovsky , Alessandra Scafuro , Silas Richelson
  bib info
• Secure Computation with Minimal Interaction, Revisited , 359-378, Eyal Kushilevitz , Yuval Ishai , Ranjit Kumaresan , Anat Paskin-Cherniavsky
  bib info
• PoW-Based Distributed Cryptography with No Trusted Setup , 379-399, Stefan Dziembowski , Marcin Andrychowicz
  bib info
• Non-Signaling and Information-Theoretic Crypto
• Multi-prover Commitments Against Non-signaling Attacks , 403-421, Serge Fehr , Max Fillinger
  bib info
• Arguments of Proximity - [Extended Abstract] , 422-442, Yael Tauman Kalai , Ron D. Rothblum
  bib info
• Distributions Attaining Secret Key at a Rate of the Conditional Mutual Information , 443-462, Eric Chitambar , Benjamin Fortescue , Min-Hsiu Hsieh
  bib info
• Privacy with Imperfect Randomness , 463-482, Yevgeniy Dodis , Yanqing Yao
  bib info
• Attribute-Based Encryption
• Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption , 485-502, Hoeteck Wee , Iordanis Kerenidis , Romain Gay
  bib info
• Predicate Encryption for Circuits from LWE , 503-523, Vinod Vaikuntanathan , Hoeteck Wee , Sergey Gorbunov
  bib info
• Bilinear Entropy Expansion from the Decisional Linear Assumption , 524-541, Lucas Kowalczyk , Allison Bishop Lewko
  bib info
• New Primitives
• Data Is a Stream: Security of Stream-Based Channels , 545-564, Kenneth G. Paterson , Marc Fischlin , Giorgia Azzurra Marson , Felix Günther
  bib info
• Bloom Filters in Adversarial Environments , 565-584, Moni Naor , Eylon Yogev
  bib info
• Proofs of Space , 585-605, Krzysztof Pietrzak , Stefan Dziembowski , Sebastian Faust , Vladimir Kolmogorov
  bib info
• Fully Homomorphic/Functional Encryption
• Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity , 609-629, Anne Broadbent , Stacey Jeffery
  bib info
• Multi-identity and Multi-key Leveled FHE from Learning with Errors , 630-656, Michael Clear , Ciaran McGoldrick
  bib info
• From Selective to Adaptive Security in Functional Encryption , 657-677, Vinod Vaikuntanathan , Gil Segev , Zvika Brakerski , Prabhanjan Ananth
  bib info
• A Punctured Programming Approach to Adaptively Secure Functional Encryption , 678-697, Brent Waters
  bib info
• Multiparty Computation III
• Secure Computation from Leaky Correlated Randomness , 701-720, Amit Sahai , Yuval Ishai , Hemanta K. Maji , Divya Gupta
  bib info
• Efficient Multi-party Computation: From Passive to Active Security via Secure SIMD Circuits , 721-741, Yuval Ishai , Antigoni Polychroniadou , Daniel Genkin
  bib info
• Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs , 742-762, Rafael Pass , Kai-Min Chung , Elette Boyle
  bib info
• Incoercible Multi-party Computation and Universally Composable Receipt-Free Voting , 763-780, Rafail Ostrovsky , Hong-Sheng Zhou , Vassilis Zikas , Joël Alwen
  bib info