![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Search 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 27 matches
- 2022
- Akshima, Siyao Guo, Qipeng Liu:
Time-Space Lower Bounds for Finding Collisions in Merkle-Damgård Hash Functions. CRYPTO (3) 2022: 192-221 - John Baena, Pierre Briaud, Daniel Cabarcas, Ray A. Perlner, Daniel Smith-Tone, Javier A. Verbel:
Improving Support-Minors Rank Attacks: Applications to Gđisplaystyle eMSS and Rainbow. CRYPTO (3) 2022: 376-405 - Christof Beierle, Tim Beyne
, Patrick Felke, Gregor Leander
:
Constructing and Deconstructing Intentional Weaknesses in Symmetric Ciphers. CRYPTO (3) 2022: 748-778 - Tim Beyne
, Vincent Rijmen
:
Differential Cryptanalysis in the Fixed-Key Model. CRYPTO (3) 2022: 687-716 - Nir Bitansky, Zvika Brakerski, Yael Tauman Kalai:
Constructive Post-Quantum Reductions. CRYPTO (3) 2022: 654-683 - Nir Bitansky, Sapir Freizeit:
Statistically Sender-Private OT from LPN and Derandomization. CRYPTO (3) 2022: 625-653 - Jeremiah Blocki
, Blake Holman
:
Sustained Space and Cumulative Complexity Trade-Offs for Data-Dependent Memory-Hard Functions. CRYPTO (3) 2022: 222-251 - Federico Canale, Gregor Leander
, Lukas Stennes:
Simon's Algorithm and Symmetric Crypto: Generalizations and Automatized Applications. CRYPTO (3) 2022: 779-808 - Shujiao Cao
, Rui Xue
:
The Gap Is Sensitive to Size of Preimages: Collapsing Property Doesn't Go Beyond Quantum Collision-Resistance for Preimages Bounded Hash Functions. CRYPTO (3) 2022: 564-595 - Rutchathon Chairattana-Apirom, Lucjan Hanzlik, Julian Loss, Anna Lysyanskaya, Benedikt Wagner:
PI-Cut-Choo and Friends: Compact Blind Signatures via Parallel Instance Cut-and-Choose and More. CRYPTO (3) 2022: 3-31 - Nai-Hui Chia, Kai-Min Chung, Xiao Liang
, Takashi Yamakawa:
Post-quantum Simulatable Extraction with Minimal Assumptions: Black-Box and Constant-Round. CRYPTO (3) 2022: 533-563 - Shahar P. Cohen
, Moni Naor
:
Low Communication Complexity Protocols, Collision Resistant Hash Functions and Secret Key-Agreement Protocols. CRYPTO (3) 2022: 252-281 - Andre Esser
, Alexander May
, Javier A. Verbel
, Weiqiang Wen:
Partial Key Exposure Attacks on BIKE, Rainbow and NTRU. CRYPTO (3) 2022: 346-375 - Cody Freitag
, Ashrujit Ghoshal
, Ilan Komargodski
:
Time-Space Tradeoffs for Sponge Hashing: Attacks and Limitations for Short Collisions. CRYPTO (3) 2022: 131-160 - Ashrujit Ghoshal
, Ilan Komargodski
:
On Time-Space Tradeoffs for Bounded-Length Collisions in Merkle-Damgård Hashing. CRYPTO (3) 2022: 161-191 - Iftach Haitner
, Daniel Nukrai, Eylon Yogev
:
Lower Bound on SNARGs in the Random Oracle Model. CRYPTO (3) 2022: 97-127 - Justin Holmgren, Minghao Liu, LaKyah Tyner, Daniel Wichs:
Nearly Optimal Property Preserving Hashing. CRYPTO (3) 2022: 473-502 - Ilan Komargodski
, Shin'ichiro Matsuo
, Elaine Shi, Ke Wu
:
log *-Round Game-Theoretically-Fair Leader Election. CRYPTO (3) 2022: 409-438 - Yusuke Naito, Yu Sasaki, Takeshi Sugawara
:
Secret Can Be Public: Low-Memory AEAD Mode for High-Order Masking. CRYPTO (3) 2022: 315-345 - Ron D. Rothblum
, Prashant Nalini Vasudevan
:
Collision-Resistance from Multi-Collision-Resistance. CRYPTO (3) 2022: 503-529 - Maria Corte-Real Santos
, Craig Costello
, Jia Shi:
Accelerating the Delfs-Galbraith Algorithm with Fast Subfield Root Detection. CRYPTO (3) 2022: 285-314 - André Schrottenloher, Marc Stevens
:
Simplified MITM Modeling for Permutations: New (Quantum) Attacks. CRYPTO (3) 2022: 717-747 - Georgios Tsimos, Julian Loss, Charalampos Papamanthou:
Gossiping for Communication-Efficient Broadcast. CRYPTO (3) 2022: 439-469 - Mark Zhandry:
Augmented Random Oracles. CRYPTO (3) 2022: 35-65 - Mark Zhandry:
To Label, or Not To Label (in Generic Groups). CRYPTO (3) 2022: 66-96 - Mark Zhandry:
New Constructions of Collapsing Hashes. CRYPTO (3) 2022: 596-624 - Yevgeniy Dodis, Thomas Shrimpton:
Advances in Cryptology - CRYPTO 2022 - 42nd Annual International Cryptology Conference, CRYPTO 2022, Santa Barbara, CA, USA, August 15-18, 2022, Proceedings, Part III. Lecture Notes in Computer Science 13509, Springer 2022, ISBN 978-3-031-15981-7 [contents]
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-06-15 09:09 CEST 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