Остановите войну!
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 27 matches
- 2019
- Divya Gupta, Hemanta K. Maji, Mingyuan Wang:
Explicit Rate-1 Non-malleable Codes for Local Tampering. CRYPTO (1) 2019: 435-466 - Navid Alamati, Hart Montgomery, Sikhar Patranabis:
Symmetric Primitives with Structured Secrets. CRYPTO (1) 2019: 650-679 - Marshall Ball, Siyao Guo, Daniel Wichs:
Non-malleable Codes for Decision Trees. CRYPTO (1) 2019: 413-434 - Mihir Bellare, Ruth Ng, Björn Tackmann:
Nonces Are Noticed: AEAD Revisited. CRYPTO (1) 2019: 235-265 - Dan Boneh, Benedikt Bünz, Ben Fisch:
Batching Techniques for Accumulators with Applications to IOPs and Stateless Blockchains. CRYPTO (1) 2019: 561-586 - Jonathan Bootle, Vadim Lyubashevsky, Gregor Seiler:
Algebraic Techniques for Short(er) Exact Lattice-Based Zero-Knowledge Proofs. CRYPTO (1) 2019: 176-202 - Olivier Bronchain, Julien M. Hendrickx, Clément Massart, Alex Olshevsky, François-Xavier Standaert:
Leakage Certification Revisited: Bounding Model Errors in Side-Channel Security Evaluations. CRYPTO (1) 2019: 713-737 - Binyi Chen, Yilei Chen, Kristina Hostáková, Pratyay Mukherjee:
Continuous Space-Bounded Non-malleable Codes from Stronger Proofs-of-Space. CRYPTO (1) 2019: 467-495 - Yu Long Chen, Eran Lambooij, Bart Mennink:
How to Build Pseudorandom Functions from Public Random Permutations. CRYPTO (1) 2019: 266-293 - Sandro Coretti, Yevgeniy Dodis, Harish Karthikeyan, Stefano Tessaro:
Seedless Fruit Is the Sweetest: Random Number Generation, Revisited. CRYPTO (1) 2019: 205-234 - Ivan Damgård, Chaya Ganesh, Claudio Orlandi:
Proofs of Replicated Storage Without Timing Assumptions. CRYPTO (1) 2019: 355-380 - Léo Ducas, Maxime Plançon, Benjamin Wesolowski:
On the Shortness of Vectors to Be Found by the Ideal-SVP Quantum Algorithm. CRYPTO (1) 2019: 322-351 - Muhammed F. Esgin, Ron Steinfeld, Joseph K. Liu, Dongxi Liu:
Lattice-Based Zero-Knowledge Proofs: New Techniques for Shorter and Faster Constructions and Applications. CRYPTO (1) 2019: 115-146 - Yue Guo, Rafael Pass, Elaine Shi:
Synchronous, with a Chance of Partition Tolerance. CRYPTO (1) 2019: 499-529 - Ariel Hamlin, Justin Holmgren, Mor Weiss, Daniel Wichs:
On the Plausibility of Fully Homomorphic Encryption for RAMs. CRYPTO (1) 2019: 589-619 - Akiko Inoue, Tetsu Iwata, Kazuhiko Minematsu, Bertram Poettering:
Cryptanalysis of OCB2: Attacks on Authenticity and Confidentiality. CRYPTO (1) 2019: 3-31 - Samuel Jaques, John M. Schanck:
Quantum Cryptanalysis in the RAM Model: Claw-Finding Attacks on SIKE. CRYPTO (1) 2019: 32-61 - Russell W. F. Lai, Giulio Malavolta:
Subvector Commitments with Application to Succinct Arguments. CRYPTO (1) 2019: 530-560 - Giulio Malavolta, Sri Aravinda Krishnan Thyagarajan:
Homomorphic Time-Lock Puzzles and Applications. CRYPTO (1) 2019: 620-649 - Tal Moran, Ilan Orlov:
Simple Proofs of Space-Time and Rational Proofs of Storage. CRYPTO (1) 2019: 381-409 - Christopher Patton, Thomas Shrimpton:
Security in the Presence of Key Reuse: Context-Separable Interfaces and Their Applications. CRYPTO (1) 2019: 738-768 - Chris Peikert, Sina Shiehian:
Noninteractive Zero Knowledge for NP from (Plain) Learning with Errors. CRYPTO (1) 2019: 89-114 - Thomas Prest, Dahmun Goudarzi, Ange Martinelli, Alain Passelègue:
Unifying Leakage Models on a Rényi Day. CRYPTO (1) 2019: 683-712 - Rotem Tsabary:
Fully Secure Attribute-Based Encryption for t-CNF from LWE. CRYPTO (1) 2019: 62-85 - Jun Xu, Santanu Sarkar, Lei Hu, Huaxiong Wang, Yanbin Pan:
New Results on Modular Inversion Hidden Number Problem and Inversive Congruential Generator. CRYPTO (1) 2019: 297-321 - Rupeng Yang, Man Ho Au, Zhenfei Zhang, Qiuliang Xu, Zuoxia Yu, William Whyte:
Efficient Lattice-Based Zero-Knowledge Arguments with Standard Soundness: Construction and Applications. CRYPTO (1) 2019: 147-175 - Alexandra Boldyreva, Daniele Micciancio:
Advances in Cryptology - CRYPTO 2019 - 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2019, Proceedings, Part I. Lecture Notes in Computer Science 11692, Springer 2019, ISBN 978-3-030-26947-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-06-22 23:51 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