Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "worst-case hardness"
download as .bib file
@article{DBLP:journals/iacr/AggarwalMV24,
author = {Divesh Aggarwal and
Leong Jin Ming and
Alexandra Veliche},
title = {Worst-Case to Average-Case Hardness of {LWE:} {A} Simple and Practical
Perspective},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {603},
year = {2024},
url = {https://eprint.iacr.org/2024/603},
timestamp = {Wed, 24 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/AggarwalMV24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/Tiegel23,
author = {Stefan Tiegel},
editor = {Gergely Neu and
Lorenzo Rosasco},
title = {Hardness of Agnostically Learning Halfspaces from Worst-Case Lattice
Problems},
booktitle = {The Thirty Sixth Annual Conference on Learning Theory, {COLT} 2023,
12-15 July 2023, Bangalore, India},
series = {Proceedings of Machine Learning Research},
volume = {195},
pages = {3029--3064},
publisher = {{PMLR}},
year = {2023},
url = {https://proceedings.mlr.press/v195/tiegel23a.html},
timestamp = {Wed, 06 Sep 2023 17:49:05 +0200},
biburl = {https://dblp.org/rec/conf/colt/Tiegel23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/LiuP23,
author = {Yanyi Liu and
Rafael Pass},
title = {On One-way Functions and the Worst-case Hardness of Time-Bounded Kolmogorov
Complexity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR23-103}},
year = {2023},
url = {https://eccc.weizmann.ac.il/report/2023/103},
eprinttype = {ECCC},
eprint = {TR23-103},
timestamp = {Wed, 30 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/LiuP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/LiuP23,
author = {Yanyi Liu and
Rafael Pass},
title = {On One-way Functions and the Worst-case Hardness of Time-Bounded Kolmogorov
Complexity},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {1086},
year = {2023},
url = {https://eprint.iacr.org/2023/1086},
timestamp = {Fri, 04 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/LiuP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/0001HV22,
author = {Lijie Chen and
Shuichi Hirahara and
Neekon Vafa},
editor = {Mark Braverman},
title = {Average-Case Hardness of {NP} and {PH} from Worst-Case Fine-Grained
Assumptions},
booktitle = {13th Innovations in Theoretical Computer Science Conference, {ITCS}
2022, January 31 - February 3, 2022, Berkeley, CA, {USA}},
series = {LIPIcs},
volume = {215},
pages = {45:1--45:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2022.45},
doi = {10.4230/LIPICS.ITCS.2022.45},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/0001HV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2207-14030,
author = {Stefan Tiegel},
title = {Hardness of Agnostically Learning Halfspaces from Worst-Case Lattice
Problems},
journal = {CoRR},
volume = {abs/2207.14030},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2207.14030},
doi = {10.48550/ARXIV.2207.14030},
eprinttype = {arXiv},
eprint = {2207.14030},
timestamp = {Tue, 02 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2207-14030.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/Debris-AlazardR22,
author = {Thomas Debris{-}Alazard and
Nicolas Resch},
title = {Worst and Average Case Hardness of Decoding via Smoothing Bounds},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {1744},
year = {2022},
url = {https://eprint.iacr.org/2022/1744},
timestamp = {Mon, 30 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iacr/Debris-AlazardR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/crypto/YuZ21,
author = {Yu Yu and
Jiang Zhang},
editor = {Tal Malkin and
Chris Peikert},
title = {Smoothing Out Binary Linear Codes and Worst-Case Sub-exponential Hardness
for {LPN}},
booktitle = {Advances in Cryptology - {CRYPTO} 2021 - 41st Annual International
Cryptology Conference, {CRYPTO} 2021, Virtual Event, August 16-20,
2021, Proceedings, Part {III}},
series = {Lecture Notes in Computer Science},
volume = {12827},
pages = {473--501},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-84252-9\_16},
doi = {10.1007/978-3-030-84252-9\_16},
timestamp = {Mon, 16 Aug 2021 09:08:12 +0200},
biburl = {https://dblp.org/rec/conf/crypto/YuZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Hirahara21,
author = {Shuichi Hirahara},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Average-case hardness of {NP} from exponential worst-case hardness
assumptions},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {292--302},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451065},
doi = {10.1145/3406325.3451065},
timestamp = {Tue, 22 Jun 2021 19:47:11 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Hirahara21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChenHV21,
author = {Lijie Chen and
Shuichi Hirahara and
Neekon Vafa},
title = {Average-case Hardness of {NP} and {PH} from Worst-case Fine-grained
Assumptions},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR21-166}},
year = {2021},
url = {https://eccc.weizmann.ac.il/report/2021/166},
eprinttype = {ECCC},
eprint = {TR21-166},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChenHV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Hirahara21,
author = {Shuichi Hirahara},
title = {Average-Case Hardness of {NP} from Exponential Worst-Case Hardness
Assumptions},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR21-058}},
year = {2021},
url = {https://eccc.weizmann.ac.il/report/2021/058},
eprinttype = {ECCC},
eprint = {TR21-058},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Hirahara21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iet-ifs/DasSB20,
author = {Dipayan Das and
Vishal Saraswat and
Kajla Basu},
title = {Lattice signatures using {NTRU} on the hardness of worst-case ideal
lattice problems},
journal = {{IET} Inf. Secur.},
volume = {14},
number = {5},
pages = {496--504},
year = {2020},
url = {https://doi.org/10.1049/iet-ifs.2019.0580},
doi = {10.1049/IET-IFS.2019.0580},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iet-ifs/DasSB20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gecco/Yingchareonthawornchai20,
author = {Sorrachai Yingchareonthawornchai and
Proteek Chandan Roy and
Bundit Laekhanukit and
Eric Torng and
Kalyanmoy Deb},
editor = {Carlos Artemio Coello Coello},
title = {Worst-case conditional hardness and fast algorithms with random inputs
for non-dominated sorting},
booktitle = {{GECCO} '20: Genetic and Evolutionary Computation Conference, Companion
Volume, Canc{\'{u}}n, Mexico, July 8-12, 2020},
pages = {185--186},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3377929.3390073},
doi = {10.1145/3377929.3390073},
timestamp = {Mon, 20 Jul 2020 07:42:25 +0200},
biburl = {https://dblp.org/rec/conf/gecco/Yingchareonthawornchai20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/YuZ20,
author = {Yu Yu and
Jiang Zhang},
title = {Smoothing Out Binary Linear Codes and Worst-case Sub-exponential Hardness
for {LPN}},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {870},
year = {2020},
url = {https://eprint.iacr.org/2020/870},
timestamp = {Wed, 12 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/YuZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/eurocrypt/BrakerskiLVW19,
author = {Zvika Brakerski and
Vadim Lyubashevsky and
Vinod Vaikuntanathan and
Daniel Wichs},
editor = {Yuval Ishai and
Vincent Rijmen},
title = {Worst-Case Hardness for {LPN} and Cryptographic Hashing via Code Smoothing},
booktitle = {Advances in Cryptology - {EUROCRYPT} 2019 - 38th Annual International
Conference on the Theory and Applications of Cryptographic Techniques,
Darmstadt, Germany, May 19-23, 2019, Proceedings, Part {III}},
series = {Lecture Notes in Computer Science},
volume = {11478},
pages = {619--635},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-17659-4\_21},
doi = {10.1007/978-3-030-17659-4\_21},
timestamp = {Tue, 14 May 2019 13:59:22 +0200},
biburl = {https://dblp.org/rec/conf/eurocrypt/BrakerskiLVW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BrakerskiLVW18,
author = {Zvika Brakerski and
Vadim Lyubashevsky and
Vinod Vaikuntanathan and
Daniel Wichs},
title = {Worst-Case Hardness for {LPN} and Cryptographic Hashing via Code Smoothing},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-056}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/056},
eprinttype = {ECCC},
eprint = {TR18-056},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BrakerskiLVW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/BrakerskiLVW18,
author = {Zvika Brakerski and
Vadim Lyubashevsky and
Vinod Vaikuntanathan and
Daniel Wichs},
title = {Worst-Case Hardness for {LPN} and Cryptographic Hashing via Code Smoothing},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {279},
year = {2018},
url = {https://eprint.iacr.org/2018/279},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/BrakerskiLVW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/MandalPV14,
author = {Debasis Mandal and
Aduri Pavan and
Rajeswari Venugopalan},
editor = {Venkatesh Raman and
S. P. Suresh},
title = {Separating Cook Completeness from Karp-Levin Completeness Under a
Worst-Case Hardness Hypothesis},
booktitle = {34th International Conference on Foundation of Software Technology
and Theoretical Computer Science, {FSTTCS} 2014, December 15-17, 2014,
New Delhi, India},
series = {LIPIcs},
volume = {29},
pages = {445--456},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2014},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2014.445},
doi = {10.4230/LIPICS.FSTTCS.2014.445},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/MandalPV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/MandalPV14,
author = {Debasis Mandal and
Aduri Pavan and
Rajeswari Venugopalan},
title = {Separating Cook Completeness from Karp-Levin Completeness under a
Worst-Case Hardness Hypothesis},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR14-126}},
year = {2014},
url = {https://eccc.weizmann.ac.il/report/2014/126},
eprinttype = {ECCC},
eprint = {TR14-126},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/MandalPV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/MelchorBGH11,
author = {Carlos Aguilar Melchor and
Slim Bettaieb and
Philippe Gaborit and
Javier Herranz},
title = {Improving Additive and Multiplicative Homomorphic Encryption Schemes
Based on Worst-Case Hardness Assumptions\}},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {607},
year = {2011},
url = {http://eprint.iacr.org/2011/607},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/MelchorBGH11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/crypto/Gentry10,
author = {Craig Gentry},
editor = {Tal Rabin},
title = {Toward Basing Fully Homomorphic Encryption on Worst-Case Hardness},
booktitle = {Advances in Cryptology - {CRYPTO} 2010, 30th Annual Cryptology Conference,
Santa Barbara, CA, USA, August 15-19, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6223},
pages = {116--137},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-14623-7\_7},
doi = {10.1007/978-3-642-14623-7\_7},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/crypto/Gentry10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/asiacrypt/KawachiTX08,
author = {Akinori Kawachi and
Keisuke Tanaka and
Keita Xagawa},
editor = {Josef Pieprzyk},
title = {Concurrently Secure Identification Schemes Based on the Worst-Case
Hardness of Lattice Problems},
booktitle = {Advances in Cryptology - {ASIACRYPT} 2008, 14th International Conference
on the Theory and Application of Cryptology and Information Security,
Melbourne, Australia, December 7-11, 2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5350},
pages = {372--389},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-89255-7\_23},
doi = {10.1007/978-3-540-89255-7\_23},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/asiacrypt/KawachiTX08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AndreevCR99,
author = {Alexander E. Andreev and
Andrea E. F. Clementi and
Jos{\'{e}} D. P. Rolim},
title = {Worst-Case Hardness Suffices for Derandomization: {A} New Method for
Hardness-Randomness Trade-offs},
journal = {Theor. Comput. Sci.},
volume = {221},
number = {1-2},
pages = {3--18},
year = {1999},
url = {https://doi.org/10.1016/S0304-3975(99)00024-9},
doi = {10.1016/S0304-3975(99)00024-9},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AndreevCR99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AndreevCR97,
author = {Alexander E. Andreev and
Andrea E. F. Clementi and
Jos{\'{e}} D. P. Rolim},
editor = {Pierpaolo Degano and
Roberto Gorrieri and
Alberto Marchetti{-}Spaccamela},
title = {Worst-Case Hardness Suffices for Derandomization: {A} New Method for
Hardness-Randomness Trade-Offs},
booktitle = {Automata, Languages and Programming, 24th International Colloquium,
ICALP'97, Bologna, Italy, 7-11 July 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1256},
pages = {177--187},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-63165-8\_175},
doi = {10.1007/3-540-63165-8\_175},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/AndreevCR97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
retrieved on 2024-05-02 03:43 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
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
