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 26 matches
- 2023
- Divesh Aggarwal
, Eldon Chung, Maciej Obremski:
Extractors: Low Entropy Requirements Colliding with Non-malleability. CRYPTO (2) 2023: 580-610 - Marta Bellés-Muñoz, Jorge Jiménez Urroz, Javier Silva:
Revisiting Cycles of Pairing-Friendly Elliptic Curves. CRYPTO (2) 2023: 3-37 - Nir Bitansky, Omer Paneth, Dana Shamir, Tomer Solomon:
Non-interactive Universal Arguments. CRYPTO (2) 2023: 132-158 - Jonathan Bootle, Alessandro Chiesa, Katerina Sotiraki:
Lattice-Based Succinct Arguments for NP with Polylogarithmic-Time Verification. CRYPTO (2) 2023: 227-251 - Jonathan Bootle, Vadim Lyubashevsky, Ngoc Khanh Nguyen, Alessandro Sorniotti:
A Framework for Practical Anonymous Credentials from Lattices. CRYPTO (2) 2023: 384-417 - Zvika Brakerski, Maya Farber Brodsky, Yael Tauman Kalai, Alex Lombardi, Omer Paneth:
SNARGs for Monotone Policy Batch NP. CRYPTO (2) 2023: 252-283 - Jeffrey Champion, David J. Wu:
Non-interactive Zero-Knowledge from Non-interactive Batch Arguments. CRYPTO (2) 2023: 38-71 - Melissa Chase, F. Betül Durak, Serge Vaudenay:
Anonymous Tokens with Stronger Metadata Bit Hiding from Algebraic MACs. CRYPTO (2) 2023: 418-449 - Yu Long Chen, Wonseok Choi, Changmin Lee:
Improved Multi-user Security Using the Squared-Ratio Method. CRYPTO (2) 2023: 694-724 - Valerio Cini, Russell W. F. Lai, Giulio Malavolta:
Lattice-Based Succinct Arguments from Vanishing Polynomials - (Extended Abstract). CRYPTO (2) 2023: 72-105 - Quang Dao, Yuval Ishai, Aayush Jain, Huijia Lin:
Multi-party Homomorphic Secret Sharing and Sublinear MPC from Sparse LPN. CRYPTO (2) 2023: 315-348 - Yevgeniy Dodis, Niels Ferguson, Eli Goldin, Peter Hall, Krzysztof Pietrzak:
Random Oracle Combiners: Breaking the Concatenation Barrier for Collision-Resistance. CRYPTO (2) 2023: 514-546 - Stefan Dziembowski, Sebastian Faust, Tomasz Lizurej:
Individual Cryptography. CRYPTO (2) 2023: 547-579 - Ben Fisch, Zeyu Liu, Psi Vesely:
Orbweaver: Succinct Linear Functional Commitments from Lattices. CRYPTO (2) 2023: 106-131 - Ashrujit Ghoshal, Stefano Tessaro:
The Query-Complexity of Preprocessing Attacks. CRYPTO (2) 2023: 482-513 - Alexander Golovnev, Siyao Guo, Spencer Peters, Noah Stephens-Davidowitz:
Revisiting Time-Space Tradeoffs for Function Inversion. CRYPTO (2) 2023: 453-481 - Alexander Golovnev, Jonathan Lee, Srinath T. V. Setty, Justin Thaler, Riad S. Wahby:
Brakedown: Linear-Time and Field-Agnostic SNARKs for R1CS. CRYPTO (2) 2023: 193-226 - Dennis Hofheinz, Julia Kastner, Karen Klein:
The Power of Undirected Rewindings for Adaptive Security. CRYPTO (2) 2023: 725-758 - Yuval Ishai, Rafail Ostrovsky, Akash Shah:
Succinct Arguments for RAM Programs via Projection Codes. CRYPTO (2) 2023: 159-192 - Corentin Jeudy, Adeline Roux-Langlois, Olivier Sanders:
Lattice Signature with Efficient Protocols, Application to Anonymous Credentials. CRYPTO (2) 2023: 351-383 - Miroslaw Kutylowski, Giuseppe Persiano, Duong Hieu Phan, Moti Yung, Marcin Zawada:
Anamorphic Signatures: Secrecy from a Dictator Who Only Permits Authentication! CRYPTO (2) 2023: 759-790 - Arthur Lazzaretti, Charalampos Papamanthou:
TreePIR: Sublinear-Time and Polylog-Bandwidth Private Information Retrieval from DDH. CRYPTO (2) 2023: 284-314 - Yanyi Liu, Rafael Pass:
One-Way Functions and the Hardness of (Probabilistic) Time-Bounded Kolmogorov Complexity w.r.t. Samplable Distributions. CRYPTO (2) 2023: 645-673 - Brent Waters, Daniel Wichs:
Universal Amplification of KDM Security: From 1-Key Circular to Multi-Key KDM. CRYPTO (2) 2023: 674-693 - Hanshen Xiao, Srinivas Devadas:
PAC Privacy: Automatic Privacy Measurement and Control of Data Processing. CRYPTO (2) 2023: 611-644 - 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 II. Lecture Notes in Computer Science 14082, Springer 2023, ISBN 978-3-031-38544-5 [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-23 11:58 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:
