default search action
BibTeX record conf/crypto/NewtonR22
@inproceedings{DBLP:conf/crypto/NewtonR22, author = {Parker Newton and Silas Richelson}, editor = {Helena Handschuh and Anna Lysyanskaya}, title = {A Lower Bound for Proving Hardness of Learning with Rounding with Polynomial Modulus}, booktitle = {Advances in Cryptology - {CRYPTO} 2023 - 43rd Annual International Cryptology Conference, {CRYPTO} 2023, Santa Barbara, CA, USA, August 20-24, 2023, Proceedings, Part {V}}, series = {Lecture Notes in Computer Science}, volume = {14085}, pages = {805--835}, publisher = {Springer}, year = {2023}, url = {https://doi.org/10.1007/978-3-031-38554-4\_26}, doi = {10.1007/978-3-031-38554-4\_26}, timestamp = {Tue, 26 Sep 2023 07:28:01 +0200}, biburl = {https://dblp.org/rec/conf/crypto/NewtonR22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.