General Information

Accepted Papers

  1. On the Optimality of Non-Linear Computations of Length-Preserving Encryption Schemes
    Mridul Nandi
  2. Efficient Fully Structure-Preserving Signatures for Large Messages
    Jens Groth
  3. Optimized Interpolation Attacks on LowMC
    Itai Dinur & Yunwen Liu & Willi Meier & Qingju Wang
  4. Property Preserving Symmetric Encryption Revisited
    Sanjit Chatterjee & M. Prem Laxman Das
  5. QA-NIZK Arguments in Asymmetric Groups: New Tools and New Constructions
    Alonso González & Alejandro Hevia & Carla Ràfols
  6. Multiple Discrete Logarithm Problems with Auxiliary Inputs
    Taechan Kim
  7. An Asymptotically Optimal Method for Converting Bit Encryption to Multi-Bit Encryption
    Takahiro Matsuda & Goichiro Hanaoka
  8. Implementing Candidate Graded Encoding Schemes from Ideal Lattices
    Martin R. Albrecht & Catalin Cocis & Fabien Laguillaumie & Adeline Langlois
  9. Computing Individual Discrete Logarithms Faster in GF(p^n) with the NFS-DL Algorithm
    Aurore Guillevic
  10. Dual-System Simulation-Soundness with Applications to UC-PAKE and More
    Charanjit S. Jutla & Arnab Roy
  11. Riding on Asymmetry: Efficient ABE for Branching Programs
    Sergey Gorbunov & Dhinakaran Vinayagamurthy
  12. Adaptively Secure Puncturable Pseudorandom Functions in the Standard Model
    Susan Hohenberger & Venkata Koppula & Brent Waters
  13. The Tower Number Field Sieve
    Razvan Barbulescu & Pierrick Gaudry & Thorsten Kleinjung
  14. A Provably Secure Group Signature Scheme from Code-Based Assumptions
    Martianus Frederic Ezerman & Hyung Tae Lee & San Ling & Khoa Nguyen & Huaxiong Wang
  15. ASCA, SASCA and DPA with Enumeration: Which One Beats the Other and When?
    Vincent Grosso & François-Xavier Standaert
  16. A Synthetic Indifferentiability Analysis of Interleaved Double-Key Even-Mansour Ciphers
    Chun Guo & Dongdai Lin
  17. Type 2 Structure-Preserving Signature Schemes Revisited
    Sanjit Chatterjee & Alfred Menezes
  18. Analysis of SHA-512/224 and SHA-512/256
    Christoph Dobraunig & Maria Eichlseder & Florian Mendel
  19. Refinements of the k-tree Algorithm for the Generalized Birthday Problem
    Ivica Nikolić & Yu Sasaki
  20. Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
    Shi Bai & Adeline Langlois & Tancrède Lepoint & Damien Stehlé & Ron Steinfeld
  21. Solving Linear Equations Modulo Unknown Divisors: Revisited
    Yao Lu & Rui Zhang & Liqiang Peng & Dongdai Lin
  22. Another Tradeoff Attack on Sprout-like Stream Ciphers
    Bin Zhang & Xinxin Gong
  23. Beyond-Birthday-Bound Security for Tweakable Even-Mansour Ciphers with Linear Tweak and Key Mixing
    Benoît Cogliati & Yannick Seurin
  24. Design Principles for HFEv- based Multivariate Signature Schemes
    Albrecht Petzoldt & Ming-Shing Chen & Bo-Yin Yang & Chengdong Tao & Jintai Ding
  25. Counting Keys in Parallel After a Side Channel Attack
    Daniel P. Martin & Jonathan O'Connell & Elisabeth Oswald & Martijn Stam
  26. Idealizing Identity-Based Encryption
    Dennis Hofheinz & Christian Matt & Ueli Maurer
  27. On Black-Box Complexity of Universally Composable Security in the CRS model
    Carmit Hazay & Muthuramakrishnan Venkitasubramaniam
  28. Security of Full-State Keyed Sponge and Duplex: Applications to Authenticated Encryption
    Bart Mennink & Reza Reyhanitabar & Damian Vizár
  29. On the Impact of Known-Key Attacks on Hash Functions
    Bart Mennink & Bart Preneel
  30. A Unified Metric for Quantifying Information Leakage of Cryptographic Devices under Power Analysis Attacks
    Liwei Zhang & A. Adam Ding & Yunsi Fei & Pei Luo
  31. Tradeoff Cryptanalysis of Memory-Hard Functions
    Alex Biryukov & Dmitry Khovratovich
  32. How to Sequentialize Independent Parallel Attacks?
    Sonia Bogos & Serge Vaudenay
  33. Heuristic Tool for Linear Cryptanalysis with Applications to CAESAR Candidates
    Christoph Dobraunig & Maria Eichlseder & Florian Mendel
  34. Generic Security of NMAC and HMAC with Input Whitening
    Peter Gaži & Krzysztof Pietrzak & Stefano Tessaro
  35. Selective Opening Security for Receivers
    Carmit Hazay & Arpita Patra & Bogdan Warinschi
  36. Reverse-engineering of the cryptanalytic attack used in the Flame super-malware
    Max Fillinger & Marc Stevens
  37. An Inverse-free Single Keyed Tweakable Enciphering Scheme
    Ritam Bhaumik & Mridul Nandi
  38. Compactly Hiding Linear Spans: Tightly Secure Constant-Size Simulation-Sound QA-NIZK Proofs and Applications
    Benoît Libert & Thomas Peters & Marc Joye & Moti Yung
  39. Optimally Secure Block Ciphers from Ideal Primitives
    Stefano Tessaro
  40. A Unified Approach to MPC with Preprocessing using OT
    Tore Kasper Frederiksen & Marcel Keller & Emmanuela Orsini & Peter Scholl
  41. How Secure is AES under Leakage
    Andrey Bogdanov & Takanori Isobe
  42. New Circular Security Counterexamples from Decision Linear and Learning with Errors
    Allison Bishop & Susan Hohenberger & Brent Waters
  43. Composable & Modular Anonymous Credentials: Definitions and Practical Constructions
    Jan Camenisch & Maria Dubovitskaya & Kristiyan Haralambiev & Markulf Kohlweiss
  44. Secret Sharing and Statistical Zero Knowledge
    Vinod Vaikuntanathan & Prashant N. Vasudevan
  45. Key-Recovery Attacks on ASASA
    Brice Minaud & Patrick Derbez & Pierre-Alain Fouque & Pierre Karpman
  46. Oblivious Network RAM and Leveraging Parallelism to Achieve Obliviousness
    Dana Dachman-Soled & Chang Liu & Charalampos Papamanthou & Elaine Shi & Uzi Vishkin
  47. Secure Computation from Millionaire
    abhi shelat & Muthuramakrishnan Venkitasubramaniam
  48. Midori: A Block Cipher for Low Energy
    Subhadeep Banik & Andrey Bogdanov & Takanori Isobe & Kyoji Shibutani & Harunaga Hiwatari & Toru Akishita & Francesco Regazzoni
  49. New Realizations of Somewhere Statistically Binding Hashing and Positional Accumulators
    Tatsuaki Okamoto & Krzysztof Pietrzak & Brent Waters & Daniel Wichs
  50. On Cut-and-Choose Oblivious Transfer and Its Variants
    Vladimir Kolesnikov & Ranjit Kumaresan
  51. Public Verifiability in the Covert Model (Almost) for Free
    Vladimir Kolesnikov & Alex J. Malozemoff
  52. Collision Attacks against CAESAR Candidates Forgery and Key-Recovery against AEZ and Marble
    Thomas Fuhr & Gaëtan Leurent & Valentin Suder
  53. Function-Hiding Inner Product Encryption
    Allison Bishop & Abhishek Jain & Lucas Kowalczyk
  54. Multi-Input Functional Encryption for Unbounded Arity Functions
    Saikrishna Badrinarayanan & Divya Gupta & Abhishek Jain & Amit Sahai
  55. Conversions among Several Classes of Predicate Encryption and Applications to ABE with Various Compactness Tradeoffs
    Nuttapong Attrapadung & Goichiro Hanaoka & Shota Yamada
  56. Multilinear and Aggregate Pseudorandom Functions: New Constructions and Improved Security
    Michel Abdalla & Fabrice Benhamouda & Alain Passelègue
  57. A Framework for Identity-Based Encryption with Almost Tight Security
    Nuttapong Attrapadung & Goichiro Hanaoka & Shota Yamada
  58. Garbling Scheme for Formulas with Constant Size of Garbled Gates
    Carmen Kempka & Ryo Kikuchi & Susumu Kiyoshima & Koutarou Suzuki
  59. Limits of Extractability Assumptions with Distributional Auxiliary Input
    Elette Boyle & Rafael Pass
  60. FourQ: four-dimensional decompositions on a Q-curve over the Mersenne prime
    Craig Costello & Patrick Longa
  61. Multi-Party Key Exchange for Unbounded Parties from Indistinguishability Obfuscation
    Dakshita Khurana & Vanishree Rao & Amit Sahai
  62. Card-based Cryptographic Protocols using a Minimal Number of Cards
    Alexander Koch & Stefan Walzer & Kevin Härtel
  63. Three-Party ORAM for Secure Computation
    Sky Faber & Stanislaw Jarecki & Sotirios Kentros & Boyang Wei
  64. Pure Differential Privacy for Rectangle Queries via Private Partitions
    Cynthia Dwork & Moni Naor & Omer Reingold & Guy Rothblum