default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 28 matches
- 2023
- Prabhanjan Ananth, Fatih Kaleoglu, Qipeng Liu:
Cloning Games: A General Framework for Unclonable Primitives. CRYPTO (5) 2023: 66-98 - Manuel Barbosa
, Gilles Barthe, Christian Doczkal, Jelle Don, Serge Fehr, Benjamin Grégoire, Yu-Hsuan Huang, Andreas Hülsing, Yi Lee, Xiaodi Wu:
Fixing and Mechanizing the Security Proof of Fiat-Shamir with Aborts and Dilithium. CRYPTO (5) 2023: 358-389 - Manuel Barbosa, François Dupressoir, Benjamin Grégoire, Andreas Hülsing, Matthias Meijers, Pierre-Yves Strub:
Machine-Checked Security for rmXMSS as in RFC 8391 and $\mathrm {SPHINCS{+}} $. CRYPTO (5) 2023: 421-454 - James Bartusek, Dakshita Khurana:
Cryptography with Certified Deletion. CRYPTO (5) 2023: 192-223 - James Bartusek, Dakshita Khurana, Alexander Poremba:
Publicly-Verifiable Deletion via Target-Collapsing Functions. CRYPTO (5) 2023: 99-128 - James Bartusek, Dakshita Khurana, Akshayaram Srinivasan:
Secure Computation with Shared EPR Pairs (Or: How to Teleport in Zero-Knowledge). CRYPTO (5) 2023: 224-257 - Carsten Baum, Lennart Braun, Cyprien Delpech de Saint Guilhem, Michael Klooß, Emmanuela Orsini, Lawrence Roy, Peter Scholl:
Publicly Verifiable Zero-Knowledge and Post-Quantum Signatures from VOLE-in-the-Head. CRYPTO (5) 2023: 581-615 - Ward Beullens, Gregor Seiler:
LaBRADOR: Compact Proofs for R1CS from Module-SIS. CRYPTO (5) 2023: 518-548 - Zvika Brakerski:
Black-Hole Radiation Decoding Is Quantum Cryptography. CRYPTO (5) 2023: 37-65 - Zvika Brakerski, Alexandru Gheorghiu, Gregory D. Kahanamoku-Meyer, Eitan Porat, Thomas Vidick:
Simple Tests of Quantumness Also Certify Qubits. CRYPTO (5) 2023: 162-191 - Yanbo Chen:
sfDualMS: Efficient Lattice-Based Two-Round Multi-signature with Trapdoor-Free Simulation. CRYPTO (5) 2023: 716-747 - Dana Dachman-Soled, Huijing Gong, Tom Hanson, Hunter Kippen:
Revisiting Security Estimation for LWE with Hints from a Geometric Perspective. CRYPTO (5) 2023: 748-781 - Julien Devevey, Pouria Fallahpour, Alain Passelègue, Damien Stehlé:
A Detailed Analysis of Fiat-Shamir with Aborts. CRYPTO (5) 2023: 327-357 - Muhammed F. Esgin, Ron Steinfeld, Dongxi Liu, Sushmita Ruj:
Efficient Hybrid Exact/Relaxed Lattice Proofs and Applications to Rounding and VRFs. CRYPTO (5) 2023: 484-517 - Jiangxia Ge, Tianshu Shan, Rui Xue:
Tighter QCCA-Secure Key Encapsulation Mechanism with Explicit Rejection in the Quantum Random Oracle Model. CRYPTO (5) 2023: 292-324 - Vipul Goyal, Xiao Liang, Giulio Malavolta:
On Concurrent Multi-party Quantum Computation. CRYPTO (5) 2023: 129-161 - Shuai Han, Shengli Liu, Zhedong Wang, Dawu Gu:
Almost Tight Multi-user Security Under Adaptive Corruptions from LWE in the Standard Model. CRYPTO (5) 2023: 682-715 - Duhyeong Kim, Dongwon Lee, Jinyeong Seo, Yongsoo Song:
Toward Practical Lattice-Based Proof of Knowledge from Hint-MLWE. CRYPTO (5) 2023: 549-580 - Russell W. F. Lai, Giulio Malavolta:
Lattice-Based Timed Cryptography. CRYPTO (5) 2023: 782-804 - Daniele Micciancio, Mark Schultz:
Error Correction and Ciphertext Quantization in Lattice Cryptography. CRYPTO (5) 2023: 648-681 - Gabrielle De Micheli, Daniele Micciancio, Alice Pellet-Mary, Nam Tran:
Reductions from Module Lattices to Free Module Lattices, and Application to Dequantizing Module-LLL. CRYPTO (5) 2023: 836-865 - Parker Newton, Silas Richelson:
A Lower Bound for Proving Hardness of Learning with Rounding with Polynomial Modulus. CRYPTO (5) 2023: 805-835 - Jiaxin Pan, Benedikt Wagner, Runzhi Zeng:
Lattice-Based Authenticated Key Exchange with Tight Security. CRYPTO (5) 2023: 616-647 - André Schrottenloher:
Quantum Linear Key-Recovery Attacks Using the QFT. CRYPTO (5) 2023: 258-291 - Yang Yu, Huiwen Jia, Xiaoyun Wang:
Compact Lattice Gadget and Its Applications to Hash-and-Sign Signatures. CRYPTO (5) 2023: 390-420 - Mark Zhandry:
Tracing Quantum State Distinguishers via Backtracking. CRYPTO (5) 2023: 3-36 - Kaiyi Zhang, Hongrui Cui, Yu Yu:
Revisiting the Constant-Sum Winternitz One-Time Signature with Applications to SPHINCS+ and XMSS. CRYPTO (5) 2023: 455-483 - Helena Handschuh, Anna Lysyanskaya:
Advances in Cryptology - CRYPTO 2023 - 43rd Annual International Cryptology Conference, CRYPTO 2023, Santa Barbara, CA, USA, August 20-24, 2023, Proceedings, Part V. Lecture Notes in Computer Science 14085, Springer 2023, ISBN 978-3-031-38553-7 [contents]
loading more results 
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-11-14 20:40 CET from data curated 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:
