


default search action
36th CRYPTO 2016: Santa Barbara, CA, USA - Part II
- Matthew Robshaw, Jonathan Katz:
Advances in Cryptology - CRYPTO 2016 - 36th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 14-18, 2016, Proceedings, Part II. Lecture Notes in Computer Science 9815, Springer 2016, ISBN 978-3-662-53007-8
Asymmetric Cryptography
- Takashi Yamakawa, Shota Yamada, Goichiro Hanaoka, Noboru Kunihiro
:
Adversary-Dependent Lossy Trapdoor Function from Hardness of Factoring Semi-smooth RSA Subgroup Moduli. 3-32 - Eike Kiltz
, Daniel Masny, Jiaxin Pan
:
Optimal Security Proofs for Signatures from Identification Schemes. 33-61 - Florian Bourse, Rafaël Del Pino, Michele Minelli, Hoeteck Wee:
FHE Circuit Privacy Almost for Free. 62-89
Symmetric Cryptography
- Léo Perrin, Aleksei Udovenko
, Alex Biryukov
:
Cryptanalysis of a Theorem: Decomposing the Only Known Solution to the Big APN Problem. 93-122 - Christof Beierle
, Jérémy Jean, Stefan Kölbl, Gregor Leander
, Amir Moradi
, Thomas Peyrin
, Yu Sasaki, Pascal Sasdrich
, Siang Meng Sim
:
The SKINNY Family of Block Ciphers and Its Low-Latency Variant MANTIS. 123-153
Cryptanalytic Tools
- Patrick Derbez, Pierre-Alain Fouque:
Automatic Search of Meet-in-the-Middle and Impossible Differential Attacks. 157-184 - Itai Dinur, Orr Dunkelman, Nathan Keller, Adi Shamir:
Memory-Efficient Algorithms for Finding Needles in Haystacks. 185-206 - Marc Kaplan
, Gaëtan Leurent
, Anthony Leverrier
, María Naya-Plasencia:
Breaking Symmetric Cryptosystems Using Quantum Period Finding. 207-237
Hardware-Oriented Cryptography
- Joël Alwen, Jeremiah Blocki
:
Efficiently Computing Data-Independent Memory-Hard Functions. 241-271 - Stefan Dziembowski, Sebastian Faust, Gottfried Herold, Anthony Journault, Daniel Masny, François-Xavier Standaert
:
Towards Sound Fresh Re-keying with Hard (Physical) Learning Problems. 272-301 - Tobias Schneider, Amir Moradi
, Tim Güneysu
:
ParTI - Towards Combined Hardware Countermeasures Against Side-Channel and Fault-Injection Attacks. 302-332
Secure Computation and Protocols I
- Martin Hirt, Ueli Maurer, Daniel Tschudi
, Vassilis Zikas:
Network-Hiding Communication and Applications to Multi-party Protocols. 335-365 - Ranjit Kumaresan, Srinivasan Raghuraman, Adam Sealfon:
Network Oblivious Transfer. 366-396 - Carmit Hazay
, Muthuramakrishnan Venkitasubramaniam:
On the Power of Secure Two-Party Computation. 397-429 - Yuval Ishai, Eyal Kushilevitz, Manoj Prabhakaran, Amit Sahai, Ching-Hua Yu:
Secure Protocol Transformations. 430-458 - Ivan Damgård, Jesper Buus Nielsen
, Antigoni Polychroniadou, Michael A. Raskin
:
On the Communication Required for Unconditionally Secure Multiplication. 459-488
Obfuscation
- Prabhanjan Ananth, Aayush Jain, Moni Naor, Amit Sahai, Eylon Yogev:
Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption. 491-520 - Marc Fischlin, Amir Herzberg, Hod Bin Noon, Haya Schulmann:
Obfuscation Combiners. 521-550 - Zvika Brakerski, Christina Brzuska, Nils Fleischhacker
:
On Statistically Secure Obfuscation with Approximate Correctness. 551-578 - Sanjam Garg, Omkant Pandey, Akshayaram Srinivasan:
Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium. 579-604
Asymmetric Cryptography and Cryptanalysis II
- Jean-Sébastien Coron, Moon Sung Lee, Tancrède Lepoint
, Mehdi Tibouchi
:
Cryptanalysis of GGH15 Multilinear Maps. 607-628 - Eric Miles, Amit Sahai, Mark Zhandry
:
Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13. 629-658 - Navid Alamati, Chris Peikert:
Three's Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWE. 659-680 - Venkata Koppula, Brent Waters:
Circular Security Separations for Arbitrary Length Cycles from LWE. 681-700

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.