Остановите войну!
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 28 matches
- 2020
- Divesh Aggarwal, Maciej Obremski, João Ribeiro, Luisa Siniscalchi, Ivan Visconti:
How to Extract Useful Randomness from Unreliable Sources. EUROCRYPT (1) 2020: 343-372 - Shweta Agrawal, Shota Yamada:
Optimal Broadcast Encryption from Pairings and LWE. EUROCRYPT (1) 2020: 13-43 - Shweta Agrawal, Alice Pellet-Mary:
Indistinguishability Obfuscation Without Maps: Attacks and Fixes for Noisy Linear FE. EUROCRYPT (1) 2020: 110-140 - Diego F. Aranha, Claudio Orlandi, Akira Takahashi, Greg Zaverucha:
Security of Hedged Fiat-Shamir Signatures Under Fault Attacks. EUROCRYPT (1) 2020: 644-674 - Amos Beimel, Hussien Othman:
Evolving Ramp Secret Sharing with a Small Gap. EUROCRYPT (1) 2020: 529-555 - Zvika Brakerski, Nico Döttling, Sanjam Garg, Giulio Malavolta:
Candidate iO from Homomorphic Encryption Schemes. EUROCRYPT (1) 2020: 79-109 - Benedikt Bünz, Ben Fisch, Alan Szepieniec:
Transparent SNARKs from DARK Compilers. EUROCRYPT (1) 2020: 677-706 - Alessandro Chiesa, Yuncong Hu, Mary Maller, Pratyush Mishra, Psi Vesely, Nicholas P. Ward:
Marlin: Preprocessing zkSNARKs with Universal and Updatable SRS. EUROCRYPT (1) 2020: 738-768 - Alessandro Chiesa, Dev Ojha, Nicholas Spooner:
Fractal: Post-quantum and Transparent Recursive Proofs from Holography. EUROCRYPT (1) 2020: 769-793 - Henry Corrigan-Gibbs, Dmitry Kogan:
Private Information Retrieval with Sublinear Online Time. EUROCRYPT (1) 2020: 44-75 - Ronald Cramer, Chaoping Xing:
Blackbox Secret Sharing Revisited: A Coding-Theoretic Approach with Application to Expansionless Near-Threshold Schemes. EUROCRYPT (1) 2020: 499-528 - Itai Dinur:
Tight Time-Space Lower Bounds for Finding Multiple Collision Pairs and Their Applications. EUROCRYPT (1) 2020: 405-434 - Yevgeniy Dodis, Vinod Vaikuntanathan, Daniel Wichs:
Extracting Randomness from Extractor-Dependent Sources. EUROCRYPT (1) 2020: 313-342 - Orr Dunkelman, Nathan Keller, Noam Lasry, Adi Shamir:
New Slide Attacks on Almost Self-similar Ciphers. EUROCRYPT (1) 2020: 250-279 - Orr Dunkelman, Nathan Keller, Eyal Ronen, Adi Shamir:
The Retracing Boomerang Attack. EUROCRYPT (1) 2020: 280-309 - Naomi Ephraim, Cody Freitag, Ilan Komargodski, Rafael Pass:
SPARKs: Succinct Parallelizable Arguments of Knowledge. EUROCRYPT (1) 2020: 707-737 - Antonio Flórez-Gutiérrez, María Naya-Plasencia:
Improving Key-Recovery in Linear Attacks: Application to 28-Round PRESENT. EUROCRYPT (1) 2020: 221-249 - Ankit Garg, Yael Tauman Kalai, Dakshita Khurana:
Low Error Efficient Computational Extractors in the CRS Model. EUROCRYPT (1) 2020: 373-402 - Yonglin Hao, Gregor Leander, Willi Meier, Yosuke Todo, Qingju Wang:
Modeling for Three-Subset Division Property Without Unknown Subset - Improved Cube Attacks Against Trivium and Grain-128AEAD. EUROCRYPT (1) 2020: 466-495 - Aayush Jain, Nathan Manohar, Amit Sahai:
Combiners for Functional Encryption, Unconditionally. EUROCRYPT (1) 2020: 141-168 - Seongkwang Kim, ByeongHak Lee, Jooyoung Lee:
Tight Security Bounds for Double-Block Hash-then-Sum MACs. EUROCRYPT (1) 2020: 435-465 - Mridul Nandi:
Mind the Composition: Birthday Bound Attacks on EWCDMD and SoKAC21. EUROCRYPT (1) 2020: 203-220 - Jesper Buus Nielsen, Mark Simkin:
Lower Bounds for Leakage-Resilient Secret Sharing. EUROCRYPT (1) 2020: 556-577 - Sayandeep Saha, Arnab Bag, Debapriya Basu Roy, Sikhar Patranabis, Debdeep Mukhopadhyay:
Fault Template Attacks on Block Ciphers Exploiting Fault Propagation. EUROCRYPT (1) 2020: 612-643 - Alice Silverberg:
Mathematics and Cryptography: A Marriage of Convenience? - Invited Talk. EUROCRYPT (1) 2020: 3-9 - Thierry Simon, Lejla Batina, Joan Daemen, Vincent Grosso, Pedro Maat Costa Massolino, Kostas Papagiannopoulos, Francesco Regazzoni, Niels Samwel:
Friet: An Authenticated Encryption Scheme with Built-in Fault Detection. EUROCRYPT (1) 2020: 581-611 - Akin Ünal:
Impossibility Results for Lattice-Based Functional Encryption Schemes. EUROCRYPT (1) 2020: 169-199 - Anne Canteaut, Yuval Ishai:
Advances in Cryptology - EUROCRYPT 2020 - 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia, May 10-14, 2020, Proceedings, Part I. Lecture Notes in Computer Science 12105, Springer 2020, ISBN 978-3-030-45720-4 [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-05-31 22: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