default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID36. EUROCRYPT 2017: Paris, France - Part I
- 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 I. Lecture Notes in Computer Science 10210, 2017, ISBN 978-3-319-56619-1
Lattice Attacks and Constructions I
- Paul Kirchner, Pierre-Alain Fouque:
Revisiting Lattice Attacks on Overstretched NTRU Parameters. 3-26 - Jens Bauch, Daniel J. Bernstein, Henry de Valence, Tanja Lange, Christine van Vredendaal:
Short Generators Without Quantum Computers: The Case of Multiquadratics. 27-59 - Jean-François Biasse, Thomas Espitau, Pierre-Alain Fouque, Alexandre Gélin, Paul Kirchner:
Computing Generator in Cyclotomic Integer Rings - A Subfield Algorithm for the Principal Ideal Problem in L|Δ𝕂|(½) and Application to the Cryptanalysis of a FHE Scheme. 60-88
Obfuscation and Functional Encryption
- Prabhanjan Ananth, Aayush Jain, Amit Sahai:
Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption. 91-121 - Ilan Komargodski, Gil Segev:
From Minicrypt to Obfustopia via Private-Key Functional Encryption. 122-151 - Prabhanjan Ananth, Amit Sahai:
Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps. 152-181
Discrete Logarithm
- Thorsten Kleinjung, Claus Diem, Arjen K. Lenstra, Christine Priplata, Colin Stahlke:
Computation of a 768-Bit Prime Field Discrete Logarithm. 185-201 - Joshua Fried, Pierrick Gaudry, Nadia Heninger, Emmanuel Thomé:
A Kilobit Hidden SNFS Discrete Logarithm Computation. 202-231
Multiparty Computation I
- Peter Rindal, Mike Rosulek:
Improved Private Set Intersection Against Malicious Adversaries. 235-259 - Rafael Pass, Elaine Shi, Florian Tramèr:
Formal Abstractions for Attested Execution Secure Processors. 260-289
Lattice Attacks and Constructions II
- Vadim Lyubashevsky, Gregory Neven:
One-Shot Verifiable Encryption from Lattices. 293-323 - Ronald Cramer, Léo Ducas, Benjamin Wesolowski:
Short Stickelberger Class Relations and Application to Ideal-SVP. 324-348
Universal Composability
- Brandon Broadnax, Nico Döttling, Gunnar Hartung, Jörn Müller-Quade, Matthias Nagel:
Concurrently Composable Security with Shielded Super-Polynomial Simulators. 351-381 - Saikrishna Badrinarayanan, Dakshita Khurana, Rafail Ostrovsky, Ivan Visconti:
Unconditional UC-Secure Computation with (Stronger-Malicious) PUFs. 382-411
Lattice Attacks and Constructions III
- Dan Boneh, Sam Kim, Hart William Montgomery:
Private Puncturable PRFs from Standard Lattice Assumptions. 415-445 - Ran Canetti, Yilei Chen:
Constraint-Hiding Constrained PRFs for NC1 from LWE. 446-476
Zero Knowledge I
- Ronald Cramer, Ivan Damgård, Chaoping Xing, Chen Yuan:
Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness Slack. 479-500 - Payman Mohassel, Mike Rosulek, Alessandra Scafuro:
Sublinear Zero-Knowledge Arguments for RAM Programs. 501-531
Side-Channel Attacks and Countermeasures
- Gilles Barthe, François Dupressoir, Sebastian Faust, Benjamin Grégoire, François-Xavier Standaert, Pierre-Yves Strub:
Parallel Implementations of Masking Schemes and the Bounded Moment Leakage Model. 535-566 - Dahmun Goudarzi, Matthieu Rivain:
How Fast Can Higher-Order Masking Be in Software? 567-597
Functional Encryption I
- Michel Abdalla, Romain Gay, Mariana Raykova, Hoeteck Wee:
Multi-input Inner-Product Functional Encryption from Pairings. 601-626 - Shashank Agrawal, Melissa Chase:
Simplifying Design and Analysis of Complex Predicate Encryption Schemes. 627-656
Elliptic Curves
- David Kohel:
Twisted μ4-Normal Form for Elliptic Curves. 659-678 - Craig Costello, David Jao, Patrick Longa, Michael Naehrig, Joost Renes, David Urbanik:
Efficient Compression of SIDH Public Keys. 679-706
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-30 20:45 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:
