Остановите войну!
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
- 2024
- Divesh Aggarwal, Leong Jin Ming, Alexandra Veliche:
Worst-Case to Average-Case Hardness of LWE: A Simple and Practical Perspective. IACR Cryptol. ePrint Arch. 2024: 603 (2024) - 2023
- Stefan Tiegel:
Hardness of Agnostically Learning Halfspaces from Worst-Case Lattice Problems. COLT 2023: 3029-3064 - Yanyi Liu, Rafael Pass:
On One-way Functions and the Worst-case Hardness of Time-Bounded Kolmogorov Complexity. Electron. Colloquium Comput. Complex. TR23 (2023) - Yanyi Liu, Rafael Pass:
On One-way Functions and the Worst-case Hardness of Time-Bounded Kolmogorov Complexity. IACR Cryptol. ePrint Arch. 2023: 1086 (2023) - 2022
- Lijie Chen, Shuichi Hirahara, Neekon Vafa:
Average-Case Hardness of NP and PH from Worst-Case Fine-Grained Assumptions. ITCS 2022: 45:1-45:16 - Stefan Tiegel:
Hardness of Agnostically Learning Halfspaces from Worst-Case Lattice Problems. CoRR abs/2207.14030 (2022) - Thomas Debris-Alazard, Nicolas Resch:
Worst and Average Case Hardness of Decoding via Smoothing Bounds. IACR Cryptol. ePrint Arch. 2022: 1744 (2022) - 2021
- Yu Yu, Jiang Zhang:
Smoothing Out Binary Linear Codes and Worst-Case Sub-exponential Hardness for LPN. CRYPTO (3) 2021: 473-501 - Shuichi Hirahara:
Average-case hardness of NP from exponential worst-case hardness assumptions. STOC 2021: 292-302 - Lijie Chen, Shuichi Hirahara, Neekon Vafa:
Average-case Hardness of NP and PH from Worst-case Fine-grained Assumptions. Electron. Colloquium Comput. Complex. TR21 (2021) - Shuichi Hirahara:
Average-Case Hardness of NP from Exponential Worst-Case Hardness Assumptions. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- Dipayan Das, Vishal Saraswat, Kajla Basu:
Lattice signatures using NTRU on the hardness of worst-case ideal lattice problems. IET Inf. Secur. 14(5): 496-504 (2020) - Sorrachai Yingchareonthawornchai, Proteek Chandan Roy, Bundit Laekhanukit, Eric Torng, Kalyanmoy Deb:
Worst-case conditional hardness and fast algorithms with random inputs for non-dominated sorting. GECCO Companion 2020: 185-186 - Yu Yu, Jiang Zhang:
Smoothing Out Binary Linear Codes and Worst-case Sub-exponential Hardness for LPN. IACR Cryptol. ePrint Arch. 2020: 870 (2020) - 2019
- Zvika Brakerski, Vadim Lyubashevsky, Vinod Vaikuntanathan, Daniel Wichs:
Worst-Case Hardness for LPN and Cryptographic Hashing via Code Smoothing. EUROCRYPT (3) 2019: 619-635 - 2018
- Zvika Brakerski, Vadim Lyubashevsky, Vinod Vaikuntanathan, Daniel Wichs:
Worst-Case Hardness for LPN and Cryptographic Hashing via Code Smoothing. Electron. Colloquium Comput. Complex. TR18 (2018) - Zvika Brakerski, Vadim Lyubashevsky, Vinod Vaikuntanathan, Daniel Wichs:
Worst-Case Hardness for LPN and Cryptographic Hashing via Code Smoothing. IACR Cryptol. ePrint Arch. 2018: 279 (2018) - 2014
- Debasis Mandal, Aduri Pavan, Rajeswari Venugopalan:
Separating Cook Completeness from Karp-Levin Completeness Under a Worst-Case Hardness Hypothesis. FSTTCS 2014: 445-456 - Debasis Mandal, Aduri Pavan, Rajeswari Venugopalan:
Separating Cook Completeness from Karp-Levin Completeness under a Worst-Case Hardness Hypothesis. Electron. Colloquium Comput. Complex. TR14 (2014) - 2011
- Carlos Aguilar Melchor, Slim Bettaieb, Philippe Gaborit, Javier Herranz:
Improving Additive and Multiplicative Homomorphic Encryption Schemes Based on Worst-Case Hardness Assumptions}. IACR Cryptol. ePrint Arch. 2011: 607 (2011) - 2010
- Craig Gentry:
Toward Basing Fully Homomorphic Encryption on Worst-Case Hardness. CRYPTO 2010: 116-137 - 2008
- Akinori Kawachi, Keisuke Tanaka, Keita Xagawa:
Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems. ASIACRYPT 2008: 372-389 - 1999
- Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim:
Worst-Case Hardness Suffices for Derandomization: A New Method for Hardness-Randomness Trade-offs. Theor. Comput. Sci. 221(1-2): 3-18 (1999) - 1997
- Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim:
Worst-Case Hardness Suffices for Derandomization: A New Method for Hardness-Randomness Trade-Offs. ICALP 1997: 177-187
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-22 19:44 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