{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T04:26:53Z","timestamp":1778128013814,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,10,30]],"date-time":"2020-10-30T00:00:00Z","timestamp":1604016000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSF","award":["1617197"],"award-info":[{"award-number":["1617197"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,10,30]]},"DOI":"10.1145\/3372297.3417870","type":"proceedings-article","created":{"date-parts":[[2021,3,4]],"date-time":"2021-03-04T16:20:06Z","timestamp":1614874806000},"page":"425-442","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":26,"title":["Minimal Symmetric PAKE and 1-out-of-N OT from Programmable-Once Public Functions"],"prefix":"10.1145","author":[{"given":"Ian","family":"McQuoid","sequence":"first","affiliation":[{"name":"Oregon State University, Corvallis, OR, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mike","family":"Rosulek","sequence":"additional","affiliation":[{"name":"Oregon State University, Corvallis, OR, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lawrence","family":"Roy","sequence":"additional","affiliation":[{"name":"Oregon State University, Corvallis, OR, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,11,2]]},"reference":[{"key":"e_1_3_2_2_2_1","doi-asserted-by":"crossref","unstructured":"M.\n      Abdalla F.\n      Benhamouda and \n      D.\n      Pointcheval\n  . \n  Public-key encryption indistinguishable under plaintext-checkable attacks\n  . In J. Katz editor PKC \n  2015 volume \n  9020\n   of \n  LNCS pages \n  332\n  --\n  352\n  . \n  Springer Heidelberg Mar. \/ Apr. 2015.  M. Abdalla F. Benhamouda and D. Pointcheval. Public-key encryption indistinguishable under plaintext-checkable attacks. In J. Katz editor PKC 2015 volume 9020 of LNCS pages 332--352. Springer Heidelberg Mar. \/ Apr. 2015.","DOI":"10.1007\/978-3-662-46447-2_15"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"crossref","unstructured":"M.\n      Abdalla D.\n      Catalano C.\n      Chevalier and \n      D.\n      Pointcheval\n  . \n  Efficient two-party password-based key exchange protocols in the UC framework\n  . In T. Malkin editor CT-RSA \n  2008 volume \n  4964\n   of \n  LNCS pages \n  335\n  --\n  351\n  . \n  Springer Heidelberg Apr. 2008.  M. Abdalla D. Catalano C. Chevalier and D. Pointcheval. Efficient two-party password-based key exchange protocols in the UC framework. In T. Malkin editor CT-RSA 2008 volume 4964 of LNCS pages 335--351. Springer Heidelberg Apr. 2008.","DOI":"10.1007\/978-3-540-79263-5_22"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"crossref","unstructured":"M.\n      Abdalla P.-A.\n      Fouque and \n      D.\n      Pointcheval\n  . \n  Password-based authenticated key exchange in the three-party setting\n  . In S. Vaudenay editor PKC \n  2005 volume \n  3386\n   of \n  LNCS pages \n  65\n  --\n  84\n  . \n  Springer Heidelberg Jan. 2005.  M. Abdalla P.-A. Fouque and D. Pointcheval. Password-based authenticated key exchange in the three-party setting. In S. Vaudenay editor PKC 2005 volume 3386 of LNCS pages 65--84. Springer Heidelberg Jan. 2005.","DOI":"10.1007\/978-3-540-30580-4_6"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"crossref","unstructured":"M.\n      Abdalla\n     and \n      D.\n      Pointcheval\n  . \n  Simple password-based encrypted key exchange protocols\n  . In A. Menezes editor CT-RSA \n  2005 volume \n  3376\n   of \n  LNCS pages \n  191\n  --\n  208\n  . \n  Springer Heidelberg Feb. 2005.  M. Abdalla and D. Pointcheval. Simple password-based encrypted key exchange protocols. In A. Menezes editor CT-RSA 2005 volume 3376 of LNCS pages 191--208. Springer Heidelberg Feb. 2005.","DOI":"10.1007\/978-3-540-30574-3_14"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"crossref","unstructured":"M.\n      Bellare D.\n      Pointcheval and \n      P.\n      Rogaway\n  . \n  Authenticated key exchange secure against dictionary attacks\n  . In B. Preneel editor EUROCRYPT \n  2000 volume \n  1807\n   of \n  LNCS pages \n  139\n  --\n  155\n  . \n  Springer Heidelberg May 2000.  M. Bellare D. Pointcheval and P. Rogaway. Authenticated key exchange secure against dictionary attacks. In B. Preneel editor EUROCRYPT 2000 volume 1807 of LNCS pages 139--155. Springer Heidelberg May 2000.","DOI":"10.1007\/3-540-45539-6_11"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/882488.884178"},{"key":"e_1_3_2_2_8_1","first-page":"967","volume-title":"ACM CCS 2013","author":"Bernstein D. J.","year":"2013"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"crossref","unstructured":"V.\n      Boyko P. D.\n      MacKenzie and \n      S.\n      Patel\n  . \n  Provably secure password-authenticated key exchange using Diffie-Hellman\n  . In B. Preneel editor EUROCRYPT \n  2000 volume \n  1807\n   of \n  LNCS pages \n  156\n  --\n  171\n  . \n  Springer Heidelberg May 2000.  V. Boyko P. D. MacKenzie and S. Patel. Provably secure password-authenticated key exchange using Diffie-Hellman. In B. Preneel editor EUROCRYPT 2000 volume 1807 of LNCS pages 156--171. Springer Heidelberg May 2000.","DOI":"10.1007\/3-540-45539-6_12"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-21568-2_22"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"crossref","unstructured":"E.\n      Brier J.-S.\n      Coron T.\n      Icart D.\n      Madore H.\n      Randriam and \n      M.\n      Tibouchi\n  . \n  Efficient indifferentiable hashing into ordinary elliptic curves\n  . In T. Rabin editor CRYPTO \n  2010 volume \n  6223\n   of \n  LNCS pages \n  237\n  --\n  254\n  . \n  Springer Heidelberg Aug. 2010.  E. Brier J.-S. Coron T. Icart D. Madore H. Randriam and M. Tibouchi. Efficient indifferentiable hashing into ordinary elliptic curves. In T. Rabin editor CRYPTO 2010 volume 6223 of LNCS pages 237--254. Springer Heidelberg Aug. 2010.","DOI":"10.1007\/978-3-642-14623-7_13"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"crossref","unstructured":"R.\n      Canetti S.\n      Halevi J.\n      Katz Y.\n      Lindell and \n      P. D.\n      MacKenzie\n    .\n  Universally composable password-based key exchange\n  . In R. Cramer editor EUROCRYPT \n  2005 volume \n  3494\n   of \n  LNCS pages \n  404\n  --\n  421\n  . \n  Springer Heidelberg May 2005.  R. Canetti S. Halevi J. Katz Y. Lindell and P. D. MacKenzie. Universally composable password-based key exchange. In R. Cramer editor EUROCRYPT 2005 volume 3494 of LNCS pages 404--421. Springer Heidelberg May 2005.","DOI":"10.1007\/11426639_24"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-22174-8_3"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"crossref","unstructured":"R.\n      Cramer\n     and \n      V.\n      Shoup\n  . \n  Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption\n  . In L. R. Knudsen editor EUROCRYPT \n  2002 volume \n  2332\n   of \n  LNCS pages \n  45\n  --\n  64\n  . \n  Springer Heidelberg Apr. \/ May 2002.  R. Cramer and V. Shoup. Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption. In L. R. Knudsen editor EUROCRYPT 2002 volume 2332 of LNCS pages 45--64. Springer Heidelberg Apr. \/ May 2002.","DOI":"10.1007\/3-540-46035-7_4"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"crossref","unstructured":"Y.\n      Dai\n     and \n      J. P.\n      Steinberger\n  . \n  Indifferentiability of 8-round Feistel networks\n  . In M. Robshaw and J. Katz editors CRYPTO \n  2016 Part I volume \n  9814\n   of \n  LNCS pages \n  95\n  --\n  120\n  . \n  Springer Heidelberg Aug. 2016.  Y. Dai and J. P. Steinberger. Indifferentiability of 8-round Feistel networks. In M. Robshaw and J. Katz editors CRYPTO 2016 Part I volume 9814 of LNCS pages 95--120. Springer Heidelberg Aug. 2016.","DOI":"10.1007\/978-3-662-53018-4_4"},{"key":"e_1_3_2_2_17_1","volume-title":"SABER. Technical report","author":"D'Anvers J.-P.","year":"2019"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1151414.1151418"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-98113-0_26"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"crossref","unstructured":"S.\n      Jarecki H.\n      Krawczyk and \n      J.\n      Xu\n  . \n  OPAQUE: An asymmetric PAKE protocol secure against pre-computation attacks\n  . In J. B. Nielsen and V. Rijmen editors EUROCRYPT \n  2018 Part III volume \n  10822\n   of \n  LNCS pages \n  456\n  --\n  486\n  . \n  Springer Heidelberg Apr. \/ May 2018.  S. Jarecki H. Krawczyk and J. Xu. OPAQUE: An asymmetric PAKE protocol secure against pre-computation attacks. In J. B. Nielsen and V. Rijmen editors EUROCRYPT 2018 Part III volume 10822 of LNCS pages 456--486. Springer Heidelberg Apr. \/ May 2018.","DOI":"10.1007\/978-3-319-78372-7_15"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"crossref","unstructured":"J.\n      Katz R.\n      Ostrovsky and \n      M.\n      Yung\n  . \n  Efficient password-authenticated key exchange using human-memorable passwords\n  . In B. Pfitzmann editor EUROCRYPT \n  2001 volume \n  2045\n   of \n  LNCS pages \n  475\n  --\n  494\n  . \n  Springer Heidelberg May 2001.  J. Katz R. Ostrovsky and M. Yung. Efficient password-authenticated key exchange using human-memorable passwords. In B. Pfitzmann editor EUROCRYPT 2001 volume 2045 of LNCS pages 475--494. Springer Heidelberg May 2001.","DOI":"10.1007\/3-540-44987-6_29"},{"key":"e_1_3_2_2_23_1","first-page":"1257","volume-title":"Practical multi-party private set intersection from symmetric-key techniques","author":"Kolesnikov V.","year":"2017"},{"key":"e_1_3_2_2_24_1","first-page":"309","volume-title":"ACM CCS 2019","author":"Masny D.","year":"2019"},{"key":"e_1_3_2_2_25_1","volume-title":"FrodoKEM. Technical report","author":"Naehrig M.","year":"2019"},{"key":"e_1_3_2_2_26_1","volume-title":"NewHope. Technical report","author":"Poppelmann T.","year":"2019"},{"key":"e_1_3_2_2_27_1","volume-title":"CRYSTALS-KYBER. Technical report","author":"Schwabe P.","year":"2019"},{"key":"e_1_3_2_2_29_1","volume-title":"Codes and Cryptography","author":"Tibouchi M.","year":"2017"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.46586\/tches.v2019.i4.154-179"}],"event":{"name":"CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security","location":"Virtual Event USA","acronym":"CCS '20","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3372297.3417870","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3372297.3417870","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3372297.3417870","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:01:31Z","timestamp":1750197691000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3372297.3417870"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,30]]},"references-count":26,"alternative-id":["10.1145\/3372297.3417870","10.1145\/3372297"],"URL":"https:\/\/doi.org\/10.1145\/3372297.3417870","relation":{},"subject":[],"published":{"date-parts":[[2020,10,30]]},"assertion":[{"value":"2020-11-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}