Остановите войну!
for scientists:
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 24 matches
- 2017
- Felix Günther, Sogol Mazaheri:
A Formal Treatment of Multi-key Channels. CRYPTO (3) 2017: 587-618 - Tomer Ashur, Orr Dunkelman, Atul Luykx:
Boosting Authenticated Encryption Robustness with Minimal Modifications. CRYPTO (3) 2017: 3-33 - Sonia Belaïd, Fabrice Benhamouda, Alain Passelègue, Emmanuel Prouff, Adrian Thillard, Damien Vergnaud:
Private Multiplication over Finite Fields. CRYPTO (3) 2017: 397-426 - Mihir Bellare, Asha Camper Singh, Joseph Jaeger, Maya Nyayapati, Igors Stepanovs:
Ratcheted Encryption and Key Exchange: The Security of Messaging. CRYPTO (3) 2017: 619-650 - Alexandra Boldyreva, Christopher Patton, Thomas Shrimpton:
Hedging Public-Key Encryption in the Real World. CRYPTO (3) 2017: 462-494 - Xavier Boyen, Qinyi Li:
All-But-Many Lossy Trapdoor Functions from Lattices and Applications. CRYPTO (3) 2017: 298-331 - Jacqueline Brendel, Marc Fischlin, Felix Günther, Christian Janson:
PRF-ODH: Relations, Instantiations, and Impossibility Results. CRYPTO (3) 2017: 651-681 - Jan Camenisch, Manu Drijvers, Anja Lehmann:
Anonymous Attestation with Subverted TPMs. CRYPTO (3) 2017: 427-461 - Wei Dai, Viet Tung Hoang, Stefano Tessaro:
Information-Theoretic Indistinguishability via the Chi-Squared Method. CRYPTO (3) 2017: 497-523 - Yuanxi Dai, Yannick Seurin, John P. Steinberger, Aishwarya Thiruvengadam:
Indifferentiability of Iterated Even-Mansour Ciphers with Non-idealized Key-Schedules: Five Rounds Are Necessary and Sufficient. CRYPTO (3) 2017: 524-555 - Adam Everspaugh, Kenneth G. Paterson, Thomas Ristenpart, Samuel Scott:
Key Rotation for Authenticated Encryption. CRYPTO (3) 2017: 98-129 - Philippe Gaborit, Adrien Hauteville, Duong Hieu Phan, Jean-Pierre Tillich:
Identity-Based Encryption from Codes with Rank Metric. CRYPTO (3) 2017: 194-224 - Romain Gay, Dennis Hofheinz, Lisa Kohl:
Kurosawa-Desmedt Meets Tight Security. CRYPTO (3) 2017: 133-160 - Paul Grubbs, Jiahui Lu, Thomas Ristenpart:
Message Franking via Committing Authenticated Encryption. CRYPTO (3) 2017: 66-97 - Tetsu Iwata, Kazuhiko Minematsu, Thomas Peyrin, Yannick Seurin:
ZMAC: A Fast Tweakable Block Cipher Mode for Highly Secure Message Authentication. CRYPTO (3) 2017: 34-65 - Benoît Libert, Amin Sakzad, Damien Stehlé, Ron Steinfeld:
All-But-Many Lossy Trapdoor Functions and Selective Opening Chosen-Ciphertext Security from LWE. CRYPTO (3) 2017: 332-364 - Meicheng Liu:
Degree Evaluation of NFSR-Based Cryptosystems. CRYPTO (3) 2017: 227-249 - Bart Mennink, Samuel Neves:
Encrypted Davies-Meyer and Its Dual: Towards Optimal Security Using Mirror Theory. CRYPTO (3) 2017: 556-583 - Rafaël del Pino, Vadim Lyubashevsky:
Amortization with Fewer Equations for Proving Knowledge of Small Secrets. CRYPTO (3) 2017: 365-394 - Miruna Rosca, Amin Sakzad, Damien Stehlé, Ron Steinfeld:
Middle-Product Learning with Errors. CRYPTO (3) 2017: 283-297 - Yosuke Todo, Takanori Isobe, Yonglin Hao, Willi Meier:
Cube Attacks on Non-Blackbox Polynomials Based on Division Property. CRYPTO (3) 2017: 250-279 - Joanne Woodage, Rahul Chatterjee, Yevgeniy Dodis, Ari Juels, Thomas Ristenpart:
A New Distribution-Sensitive Secure Sketch and Popularity-Proportional Hashing. CRYPTO (3) 2017: 682-710 - Shota Yamada:
Asymptotically Compact Adaptively Secure Lattice IBEs and Verifiable Random Functions via Generalized Partitioning Techniques. CRYPTO (3) 2017: 161-193 - Jonathan Katz, Hovav Shacham:
Advances in Cryptology - CRYPTO 2017 - 37th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 20-24, 2017, Proceedings, Part III. Lecture Notes in Computer Science 10403, Springer 2017, ISBN 978-3-319-63696-2 [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-04-25 20:08 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