default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID37th EUROCRYPT 2019: Darmstadt, Germany - Part I
- Yuval Ishai, Vincent Rijmen:
Advances in Cryptology - EUROCRYPT 2019 - 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Darmstadt, Germany, May 19-23, 2019, Proceedings, Part I. Lecture Notes in Computer Science 11476, Springer 2019, ISBN 978-3-030-17652-5
ABE and CCA Security
- Lucas Kowalczyk, Hoeteck Wee:
Compact Adaptively Secure ABE for \mathsf NC^1 from k-Lin. 3-33 - Nuttapong Attrapadung:
Unbounded Dynamic Predicate Compositions in Attribute-Based Encryption. 34-67 - Michael Klooß
, Anja Lehmann, Andy Rupp:
(R)CCA Secure Updatable Encryption with Integrity Protection. 68-99
Succinct Arguments and Secure Messaging
- Eli Ben-Sasson, Alessandro Chiesa, Michael Riabzev, Nicholas Spooner, Madars Virza, Nicholas P. Ward:
Aurora: Transparent Succinct Arguments for R1CS. 103-128 - Joël Alwen, Sandro Coretti, Yevgeniy Dodis:
The Double Ratchet: Security Notions, Proofs, and Modularization for the Signal Protocol. 129-158 - Daniel Jost, Ueli Maurer, Marta Mularczyk:
Efficient Ratcheting: Almost-Optimal Guarantees for Secure Messaging. 159-188
Obfuscation
- Shweta Agrawal:
Indistinguishability Obfuscation Without Multilinear Maps: New Methods for Bootstrapping and Instantiation. 191-225 - Boaz Barak, Samuel B. Hopkins, Aayush Jain, Pravesh Kothari, Amit Sahai:
Sum-of-Squares Meets Program Obfuscation, Revisited. 226-250 - Aayush Jain, Huijia Lin, Christian Matt, Amit Sahai:
How to Leverage Hardness of Constant-Degree Expanding Polynomials over \mathbb R R to build i풪 i O. 251-281
Block Ciphers
- Lukas Kölsch:
XOR-Counts and Lightweight Multiplication with Fixed Elements in Binary Finite Fields. 285-312 - Achiya Bar-On, Orr Dunkelman, Nathan Keller, Ariel Weizman:
DLCT: A New Tool for Differential-Linear Cryptanalysis. 313-342 - Itai Dinur, Daniel Kales, Angela Promitzer, Sebastian Ramacher, Christian Rechberger:
Linear Equivalence of Block Ciphers with Partial Non-Linear Layers: Application to LowMC. 343-372
Differential Privacy
- Albert Cheu, Adam D. Smith, Jonathan R. Ullman, David Zeber, Maxim Zhilyaev:
Distributed Differential Privacy via Shuffling. 375-403 - Giuseppe Persiano, Kevin Yeo:
Lower Bounds for Differentially Private RAMs. 404-434
Bounds for Symmetric Cryptography
- Avijit Dutta, Mridul Nandi, Suprita Talnikar:
Beyond Birthday Bound Secure MAC in Faulty Nonce Model. 437-466 - Joseph Jaeger, Stefano Tessaro:
Tight Time-Memory Trade-Offs for Symmetric Encryption. 467-497
Non-malleability
- Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Huijia Lin, Tal Malkin:
Non-Malleable Codes Against Bounded Polynomial Time Tampering. 501-530 - Divesh Aggarwal, Nico Döttling, Jesper Buus Nielsen, Maciej Obremski, Erick Purwanto:
Continuous Non-Malleable Codes in the 8-Split-State Model. 531-561 - Vipul Goyal, Yifan Song:
Correlated-Source Extractors and Cryptography with Correlated-Random Tapes. 562-592 - Saikrishna Badrinarayanan, Akshayaram Srinivasan:
Revisiting Non-Malleable Secret Sharing. 593-622
Blockchain and Consensus
- Stefan Dziembowski, Lisa Eckey, Sebastian Faust, Julia Hesse, Kristina Hostáková:
Multi-party Virtual State Channels. 625-656 - Georg Fuchsbauer, Michele Orrù, Yannick Seurin:
Aggregate Cash Systems: A Cryptographic Investigation of Mimblewimble. 657-689 - Chaya Ganesh, Claudio Orlandi, Daniel Tschudi:
Proof-of-Stake Protocols for Privacy-Aware Blockchains. 690-719 - T.-H. Hubert Chan, Rafael Pass, Elaine Shi:
Consensus Through Herding. 720-749
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 2026-10-17 00:39 CEST 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
