Остановите войну!
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 29 matches
- 2019
- Rohit Agrawal, Yi-Hsiu Chen, Thibaut Horel, Salil P. Vadhan:
Unifying Computational Entropies via Kullback-Leibler Divergence. CRYPTO (2) 2019: 831-858 - Divesh Aggarwal, Ivan Damgård, Jesper Buus Nielsen, Maciej Obremski, Erick Purwanto, João Ribeiro, Mark Simkin:
Stronger Leakage-Resilient and Non-Malleable Secret Sharing Schemes for General Access Structures. CRYPTO (2) 2019: 510-539 - Shweta Agrawal, Monosij Maitra, Shota Yamada:
Attribute Based Encryption (and more) for Nondeterministic Finite Automata from LWE. CRYPTO (2) 2019: 765-797 - Andris Ambainis, Mike Hamburg, Dominique Unruh:
Quantum Security Proofs Using Semi-classical Oracles. CRYPTO (2) 2019: 269-295 - Giuseppe Ateniese, Danilo Francati, David Nuñez, Daniele Venturi:
Match Me if You Can: Matchmaking Encryption and Its Applications. CRYPTO (2) 2019: 701-731 - Borja Balle, James Bell, Adrià Gascón, Kobbi Nissim:
The Privacy Blanket of the Shuffle Model. CRYPTO (2) 2019: 638-667 - James Bartusek, Fermi Ma, Mark Zhandry:
The Distinction Between Fixed and Random Generators in Group-Based Assumptions. CRYPTO (2) 2019: 801-830 - Jeremiah Blocki, Benjamin Harsha, Siteng Kang, Seunghoon Lee, Lu Xing, Samson Zhou:
Data-Independent Memory Hard Functions: New Attacks and Stronger Constructions. CRYPTO (2) 2019: 573-607 - Andrej Bogdanov, Yuval Ishai, Akshayaram Srinivasan:
Unconditionally Secure Computation Against Low-Complexity Leakage. CRYPTO (2) 2019: 387-416 - Binyi Chen, Stefano Tessaro:
Memory-Hard Functions from Cryptographic Primitives. CRYPTO (2) 2019: 543-572 - Ran Cohen, Abhi Shelat, Daniel Wichs:
Adaptively Secure MPC with Sublinear Communication Complexity. CRYPTO (2) 2019: 30-60 - Jan Czajkowski, Andreas Hülsing, Christian Schaffner:
Quantum Indistinguishability of Random Sponges. CRYPTO (2) 2019: 296-325 - Ivan Damgård, Kasper Green Larsen, Jesper Buus Nielsen:
Communication Lower Bounds for Statistically Secure MPC, With or Without Preprocessing. CRYPTO (2) 2019: 61-84 - Jelle Don, Serge Fehr, Christian Majenz, Christian Schaffner:
Security of the Fiat-Shamir Transformation in the Quantum Random-Oracle Model. CRYPTO (2) 2019: 356-383 - Antonio Faonio, Daniele Venturi:
Non-malleable Secret Sharing in the Computational Setting: Adaptive Tampering, Noisy-Leakage Resilience, and Improved Rate. CRYPTO (2) 2019: 448-479 - Satrajit Ghosh, Mark Simkin:
The Communication Complexity of Threshold Private Set Intersection. CRYPTO (2) 2019: 3-29 - Aron Gohr:
Improving Attacks on Round-Reduced Speck32/64 Using Deep Learning. CRYPTO (2) 2019: 150-179 - Junqing Gong, Brent Waters, Hoeteck Wee:
ABE for DFA from k-Lin. CRYPTO (2) 2019: 732-764 - Vipul Goyal, Aayush Jain, Amit Sahai:
Simultaneous Amplification: The Case of Non-interactive Zero-Knowledge. CRYPTO (2) 2019: 608-637 - Vipul Goyal, Yanyi Liu, Yifan Song:
Communication-Efficient Unconditional MPC with Guaranteed Output Delivery. CRYPTO (2) 2019: 85-114 - Shuai Han, Shengli Liu, Lin Lyu, Dawu Gu:
Tight Leakage-Resilient CCA-Security from Quasi-Adaptive Hash Proof System. CRYPTO (2) 2019: 417-447 - Venkata Koppula, Brent Waters:
Realizing Chosen Ciphertext Security Generically in Attribute-Based Encryption and Predicate Encryption. CRYPTO (2) 2019: 671-700 - Gaëtan Leurent, Ferdinand Sibleyras:
Low-Memory Attacks Against Two-Round Even-Mansour Using the 3-XOR Problem. CRYPTO (2) 2019: 210-235 - Fukang Liu, Christoph Dobraunig, Florian Mendel, Takanori Isobe, Gaoli Wang, Zhenfu Cao:
Efficient Collision Attack Frameworks for RIPEMD-160. CRYPTO (2) 2019: 117-149 - Qipeng Liu, Mark Zhandry:
Revisiting Post-quantum Fiat-Shamir. CRYPTO (2) 2019: 326-355 - Danping Shi, Siwei Sun, Yu Sasaki, Chaoyun Li, Lei Hu:
Correlation of Quadratic Boolean Functions: Cryptanalysis of All Versions of Full \mathsf MORUS. CRYPTO (2) 2019: 180-209 - Akshayaram Srinivasan, Prashant Nalini Vasudevan:
Leakage Resilient Secret Sharing and Applications. CRYPTO (2) 2019: 480-509 - Mark Zhandry:
How to Record Quantum Queries, and Applications to Quantum Indifferentiability. CRYPTO (2) 2019: 239-268 - Alexandra Boldyreva, Daniele Micciancio:
Advances in Cryptology - CRYPTO 2019 - 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2019, Proceedings, Part II. Lecture Notes in Computer Science 11693, Springer 2019, ISBN 978-3-030-26950-0 [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-27 11:11 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