default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID36. EUROCRYPT 2017: Paris, France - Part III
- Jean-Sébastien Coron, Jesper Buus Nielsen
:
Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30 - May 4, 2017, Proceedings, Part III. Lecture Notes in Computer Science 10212, 2017, ISBN 978-3-319-56616-0
Memory Hard Functions
- Joël Alwen, Jeremiah Blocki, Krzysztof Pietrzak:
Depth-Robust Graphs and Their Cumulative Memory Complexity. 3-32 - Joël Alwen, Binyi Chen, Krzysztof Pietrzak, Leonid Reyzin, Stefano Tessaro:
Scrypt Is Maximally Memory-Hard. 33-62
Symmetric-Key Constructions
- Gorjan Alagic, Alexander Russell:
Quantum-Secure Symmetric-Key Cryptography Based on Hidden Shifts. 65-93 - Seny Kamara, Tarik Moataz:
Boolean Searchable Symmetric Encryption with Worst-Case Sub-linear Complexity. 94-124
Obfuscation I
- Prabhanjan Ananth, Abhishek Jain, Amit Sahai:
Patchable Indistinguishability Obfuscation: iO for Evolving Software. 127-155 - Sanjam Garg, Omkant Pandey, Akshayaram Srinivasan, Mark Zhandry:
Breaking the Sub-Exponential Barrier in Obfustopia. 156-181
Symmetric Cryptanalysis II
- Yu Sasaki, Yosuke Todo:
New Impossible Differential Search Tool from Design and Cryptanalysis Aspects - Revealing Structural Properties of Several Ciphers. 185-215 - Kexin Qiao, Ling Song, Meicheng Liu, Jian Guo:
New Collision Attacks on Round-Reduced Keccak. 216-243
Obfuscation II
- Dan Boneh, Yuval Ishai, Amit Sahai, David J. Wu:
Lattice-Based SNARGs and Their Application to More Efficient Obfuscation. 247-277 - Yilei Chen, Craig Gentry, Shai Halevi:
Cryptanalyses of Candidate Branching Program Obfuscators. 278-307
Quantum Cryptography
- Serge Fehr, Louis Salvail:
Quantum Authentication and Encryption with Key Recycling - Or: How to Re-use a One-Time Pad Even if P=NP - Safely & Feasibly. 311-338 - Christopher Portmann:
Quantum Authentication with Key Recycling. 339-368 - André Chailloux, Anthony Leverrier:
Relativistic (or 2-Prover 1-Round) Zero-Knowledge Protocol for \mathsf NP Secure Against Quantum Adversaries. 369-396
Multiparty Computation III
- Xiao Wang, Alex J. Malozemoff, Jonathan Katz:
Faster Secure Two-Party Computation in the Single-Execution Setting. 399-424 - Payman Mohassel, Mike Rosulek:
Non-interactive Secure 2PC in the Offline/Online and Batch Settings. 425-455 - Xiong Fan, Chaya Ganesh, Vladimir Kolesnikov:
Hashing Garbled Circuits for Free. 456-485
Public-Key Encryption and Key-Exchange
- Dennis Hofheinz:
Adaptive Partitioning. 489-518 - Felix Günther, Britta Hale, Tibor Jager, Sebastian Lauer:
0-RTT Key Exchange with Full Forward Secrecy. 519-548
Multiparty Computation IV
- Eli Ben-Sasson, Iddo Bentov, Alessandro Chiesa, Ariel Gabizon, Daniel Genkin, Matan Hamilis, Evgenya Pergament, Michael Riabzev, Mark Silberstein, Eran Tromer, Madars Virza:
Computational Integrity with a Public Random String from Quasi-Linear PCPs. 551-579 - Amos Beimel, Yuval Ishai, Eyal Kushilevitz:
Ad Hoc PSM Protocols: Secure Computation Without Coordination. 580-608 - Adi Akavia, Tal Moran:
Topology-Hiding Computation Beyond Logarithmic Diameter. 609-637
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.
last updated on 2024-10-31 20:22 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
