Остановите войну!
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 30 matches
- 2020
- Qian Guo, Thomas Johansson, Alexander Nilsson:
A Key-Recovery Timing Attack on Post-quantum Primitives Using the Fujisaki-Okamoto Transformation and Its Application on FrodoKEM. CRYPTO (2) 2020: 359-386 - Daniel Escudero, Satrajit Ghosh, Marcel Keller, Rahul Rachuri, Peter Scholl:
Improved Primitives for MPC over Mixed Arithmetic-Binary Circuits. CRYPTO (2) 2020: 823-852 - Divesh Aggarwal, Jianwei Li, Phong Q. Nguyen, Noah Stephens-Davidowitz:
Slide Reduction, Revisited - Filling the Gaps in SVP Approximation. CRYPTO (2) 2020: 274-295 - Martin R. Albrecht, Shi Bai, Pierre-Alain Fouque, Paul Kirchner, Damien Stehlé, Weiqiang Wen:
Faster Enumeration-Based Lattice Reduction: Root Hermite Factor k1/(2k) Time kk/8+o(k). CRYPTO (2) 2020: 186-212 - Bar Alon, Eran Omri, Anat Paskin-Cherniavsky:
MPC with Friends and Foes. CRYPTO (2) 2020: 677-706 - Thomas Attema, Vadim Lyubashevsky, Gregor Seiler:
Practical Product Proofs for Lattice Commitments. CRYPTO (2) 2020: 470-499 - Balthazar Bauer, Georg Fuchsbauer, Julian Loss:
A Classification of Computational Assumptions in the Algebraic Group Model. CRYPTO (2) 2020: 121-151 - Carsten Baum, Emmanuela Orsini, Peter Scholl, Eduardo Soria-Vazquez:
Efficient Constant-Round MPC with Identifiable Abort and Public Verifiability. CRYPTO (2) 2020: 562-592 - Erica Blum, Chen-Da Liu Zhang, Julian Loss:
Always Have a Backup Plan: Fully Secure Synchronous MPC with Asynchronous Fallback. CRYPTO (2) 2020: 707-731 - Koen de Boer, Léo Ducas, Alice Pellet-Mary, Benjamin Wesolowski:
Random Self-reducibility of Ideal-SVP via Arakelov Random Walks. CRYPTO (2) 2020: 243-273 - Jonathan Bootle, Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler:
A Non-PCP Approach to Succinct Quantum-Safe Zero-Knowledge. CRYPTO (2) 2020: 441-469 - Fabrice Boudot, Pierrick Gaudry, Aurore Guillevic, Nadia Heninger, Emmanuel Thomé, Paul Zimmermann:
Comparing the Difficulty of Factorization and Discrete Logarithm: A 240-Digit Experiment. CRYPTO (2) 2020: 62-91 - Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Peter Scholl:
Efficient Pseudorandom Correlation Generators from Ring-LPN. CRYPTO (2) 2020: 387-416 - Zvika Brakerski, Omri Shmueli:
Scalable Pseudorandom Quantum States. CRYPTO (2) 2020: 417-440 - Wouter Castryck, Jana Sotáková, Frederik Vercauteren:
Breaking the Decisional Diffie-Hellman Problem for Class Group Actions Using Genus Theory. CRYPTO (2) 2020: 92-120 - Suvradip Chakraborty, Stefan Dziembowski, Jesper Buus Nielsen:
Reverse Firewalls for Actively Secure MPCs. CRYPTO (2) 2020: 732-762 - Jean-Sébastien Coron, Agnese Gini:
A Polynomial-Time Algorithm for Solving the Hidden Subset Sum Problem. CRYPTO (2) 2020: 3-31 - Dana Dachman-Soled, Léo Ducas, Huijing Gong, Mélissa Rossi:
LWE with Side Information: Attacks and Concrete Security Estimation. CRYPTO (2) 2020: 329-358 - Ivan Damgård, Claudio Orlandi, Mark Simkin:
Black-Box Transformations from Passive to Covert Security with Public Verifiability. CRYPTO (2) 2020: 647-676 - Vipul Goyal, Yifan Song, Chenzhi Zhu:
Guaranteed Output Delivery Comes Free in Honest Majority MPC. CRYPTO (2) 2020: 618-646 - Chun Guo, Jonathan Katz, Xiao Wang, Chenkai Weng, Yu Yu:
Better Concrete Security for Half-Gates Garbling (in the Multi-instance Setting). CRYPTO (2) 2020: 793-822 - Eduard Hauck, Eike Kiltz, Julian Loss, Ngoc Khanh Nguyen:
Lattice-Based Blind Signatures, Revisited. CRYPTO (2) 2020: 500-529 - David Heath, Vladimir Kolesnikov:
Stacked Garbling - Garbled Circuit Proportional to Longest Execution Path. CRYPTO (2) 2020: 763-792 - Paul Kirchner, Thomas Espitau, Pierre-Alain Fouque:
Fast Reduction of Algebraic Lattices over Cyclotomic Fields. CRYPTO (2) 2020: 155-185 - Susumu Kiyoshima:
Round-Optimal Black-Box Commit-and-Prove with Succinct Communication. CRYPTO (2) 2020: 533-561 - Feng-Hao Liu, Zhedong Wang:
Rounding in the Rings. CRYPTO (2) 2020: 296-326 - Hemanta K. Maji, Mingyuan Wang:
Black-Box Use of One-Way Functions is Useless for Optimal Fair Coin-Tossing. CRYPTO (2) 2020: 593-617 - Gabrielle De Micheli, Pierrick Gaudry, Cécile Pierrot:
Asymptotic Complexities of Discrete Logarithm Algorithms in Pairing-Relevant Finite Fields. CRYPTO (2) 2020: 32-61 - Tamalika Mukherjee, Noah Stephens-Davidowitz:
Lattice Reduction for Modules, or How to Reduce ModuleSVP to ModuleSVP. CRYPTO (2) 2020: 213-242 - Daniele Micciancio, Thomas Ristenpart:
Advances in Cryptology - CRYPTO 2020 - 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17-21, 2020, Proceedings, Part II. Lecture Notes in Computer Science 12171, Springer 2020, ISBN 978-3-030-56879-5 [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-06 09:55 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