{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T13:19:40Z","timestamp":1773839980423,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":42,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,10,24]],"date-time":"2016-10-24T00:00:00Z","timestamp":1477267200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100002347","name":"Bundesministerium f\u00fcr Bildung und Forschung","doi-asserted-by":"publisher","award":["FKZ: 16KIS0345"],"award-info":[{"award-number":["FKZ: 16KIS0345"]}],"id":[{"id":"10.13039\/501100002347","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["SFB 1223, project B4"],"award-info":[{"award-number":["SFB 1223, project B4"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,10,24]]},"DOI":"10.1145\/2976749.2978375","type":"proceedings-article","created":{"date-parts":[[2016,10,25]],"date-time":"2016-10-25T12:46:35Z","timestamp":1477399595000},"page":"1192-1203","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":26,"title":["Efficient Cryptographic Password Hardening Services from Partially Oblivious Commitments"],"prefix":"10.1145","author":[{"given":"Jonas","family":"Schneider","sequence":"first","affiliation":[{"name":"Saarland Informatics Campus, Saarland, Germany"}]},{"given":"Nils","family":"Fleischhacker","sequence":"additional","affiliation":[{"name":"Saarland Informatics Campus, Saarland, Germany"}]},{"given":"Dominique","family":"Schr\u00f6der","sequence":"additional","affiliation":[{"name":"Friedrich-Alexander-University, Erlangen-N\u00fcrnberg, N\u00fcrnberg, Germany"}]},{"given":"Michael","family":"Backes","sequence":"additional","affiliation":[{"name":"Saarland Informatics Campus, Saarland, Germany"}]}],"member":"320","published-online":{"date-parts":[[2016,10,24]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s13389-013-0057-3"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"F.\n      Armknecht\n     and \n      J.\n      Furukawa\n  . \n  On the minimum communication effort for secure group key exchange\n  . In A. Biryukov G. Gong and D. R. Stinson editors SAC \n  2010 volume \n  6544\n   of \n  LNCS pages \n  320\n  --\n  337 Waterloo Ontario Canada Aug. 12--13 2011. \n  Springer Heidelberg Germany.   F. Armknecht and J. Furukawa. On the minimum communication effort for secure group key exchange. In A. Biryukov G. Gong and D. R. Stinson editors SAC 2010 volume 6544 of LNCS pages 320--337 Waterloo Ontario Canada Aug. 12--13 2011. Springer Heidelberg Germany.","DOI":"10.1007\/978-3-642-19574-7_22"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2046707.2046758"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44371-2_6"},{"key":"e_1_3_2_1_5_1","unstructured":"M.\n      Belenkiy M.\n      Chase M.\n      Kohlweiss and \n      A.\n      Lysyanskaya\n  . \n  P-signatures and noninteractive anonymous credentials\n  . In R. Canetti editor TCC \n  2008 volume \n  4948\n   of \n  LNCS pages \n  356\n  --\n  374 San Francisco CA USA Mar. 19--21 2008. \n  Springer Heidelberg Germany.   M. Belenkiy M. Chase M. Kohlweiss and A. Lysyanskaya. P-signatures and noninteractive anonymous credentials. In R. Canetti editor TCC 2008 volume 4948 of LNCS pages 356--374 San Francisco CA USA Mar. 19--21 2008. Springer Heidelberg Germany."},{"key":"e_1_3_2_1_6_1","volume-title":"Proceedings of the ISOC Network and Distributed System Security Symposium (NDSS). Citeseer","author":"Berson T.","year":"2001"},{"key":"e_1_3_2_1_7_1","volume-title":"Internet Engineering Task Force","author":"Biryukov A.","year":"2016"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"D.\n      Boneh\n     and \n      R.\n      Venkatesan\n  . \n  Breaking RSA may not be equivalent to factoring\n  . In K. Nyberg editor EUROCRYPT'98 volume \n  1403\n   of \n  LNCS pages \n  59\n  --\n  71 Espoo Finland May 31 -- June 4 1998\n  . \n  Springer Heidelberg Germany.  D. Boneh and R. Venkatesan. Breaking RSA may not be equivalent to factoring. In K. Nyberg editor EUROCRYPT'98 volume 1403 of LNCS pages 59--71 Espoo Finland May 31 -- June 4 1998. Springer Heidelberg Germany.","DOI":"10.1007\/BFb0054117"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"D.\n      Boneh\n     and \n      B.\n      Waters\n  . \n  Constrained pseudorandom functions and their applications\n  . In K. Sako and P. Sarkar editors ASIACRYPT \n  2013 Part II volume \n  8270\n   of \n  LNCS pages \n  280\n  --\n  300 Bengalore India Dec. 1--5 2013. \n  Springer Heidelberg Germany.  D. Boneh and B. Waters. Constrained pseudorandom functions and their applications. In K. Sako and P. Sarkar editors ASIACRYPT 2013 Part II volume 8270 of LNCS pages 280--300 Bengalore India Dec. 1--5 2013. Springer Heidelberg Germany.","DOI":"10.1007\/978-3-642-42045-0_15"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"E.\n      Bresson J.\n      Monnerat and \n      D.\n      Vergnaud\n  . \n  Separation results on the \"one-more\" computational problems\n  . In T. Malkin editor CT-RSA \n  2008 volume \n  4964\n   of \n  LNCS pages \n  71\n  --\n  87 San Francisco CA USA Apr. 7--11 2008. \n  Springer Heidelberg Germany.   E. Bresson J. Monnerat and D. Vergnaud. Separation results on the \"one-more\" computational problems. In T. Malkin editor CT-RSA 2008 volume 4964 of LNCS pages 71--87 San Francisco CA USA Apr. 7--11 2008. Springer Heidelberg Germany.","DOI":"10.1007\/978-3-540-79263-5_5"},{"key":"e_1_3_2_1_11_1","volume-title":"Irreducibility to the one-more evaluation problems: More may be less","author":"Brown D. R. L.","year":"2007"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10838-9_22"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1180405.1180431"},{"key":"e_1_3_2_1_14_1","first-page":"199","volume-title":"CRYPTO'82","author":"Chaum D.","year":"1982"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"D.\n      Chaum\n     and \n      T. P.\n      Pedersen\n  . \n  Wallet databases with observers\n  . In E. F. Brickell editor CRYPTO'92 volume \n  740\n   of \n  LNCS pages \n  89\n  --\n  105 Santa Barbara CA USA Aug. 16--20 1993\n  . \n  Springer Heidelberg Germany.   D. Chaum and T. P. Pedersen. Wallet databases with observers. In E. F. Brickell editor CRYPTO'92 volume 740 of LNCS pages 89--105 Santa Barbara CA USA Aug. 16--20 1993. Springer Heidelberg Germany.","DOI":"10.1007\/3-540-48071-4_7"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"M.\n      Di Raimondo\n     and \n      R.\n      Gennaro\n  . \n  Provably secure threshold password-authenticated key exchange\n  . In E. Biham editor EUROCRYPT \n  2003 volume \n  2656\n   of \n  LNCS pages \n  507\n  --\n  523 Warsaw Poland May 4--8 2003. \n  Springer Heidelberg Germany.   M. Di Raimondo and R. Gennaro. Provably secure threshold password-authenticated key exchange. In E. Biham editor EUROCRYPT 2003 volume 2656 of LNCS pages 507--523 Warsaw Poland May 4--8 2003. Springer Heidelberg Germany.","DOI":"10.1007\/3-540-39200-9_32"},{"key":"e_1_3_2_1_17_1","volume-title":"Is it too late for pake? indicators, 5(9):17","author":"Engler J.","year":"2009"},{"key":"e_1_3_2_1_18_1","volume-title":"Pythia server (prototype) implementation. https:\/\/github.com\/ace0\/pythia","author":"Everspaugh A.","year":"2015"},{"key":"e_1_3_2_1_19_1","first-page":"547","volume-title":"24th USENIX Security Symposium (USENIX Security 15)","author":"Everspaugh A.","year":"2015"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"A.\n      Fiat\n     and \n      A.\n      Shamir\n  . \n  How to prove yourself: Practical solutions to identification and signature problems\n  . In A. M. Odlyzko editor CRYPTO'86 volume \n  263\n   of \n  LNCS pages \n  186\n  --\n  194 Santa Barbara CA USA Aug. \n  1987\n  . \n  Springer Heidelberg Germany.   A. Fiat and A. Shamir. How to prove yourself: Practical solutions to identification and signature problems. In A. M. Odlyzko editor CRYPTO'86 volume 263 of LNCS pages 186--194 Santa Barbara CA USA Aug. 1987. Springer Heidelberg Germany.","DOI":"10.1007\/3-540-47721-7_12"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00468-1_17"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_10"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1515\/jmc.2011.011"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30576-7_17"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"A.\n      Herzberg\n     and \n      R.\n      Margulies\n  . \n  Forcing johnny to login safely - long-term user study of forcing and training login mechanisms\n  . In V. Atluri and C. D\u00edaz editors ESORICS \n  2011 volume \n  6879\n   of \n  LNCS pages \n  452\n  --\n  471 Leuven Belgium Sept. 12--14 2011. \n  Springer Heidelberg Germany.   A. Herzberg and R. Margulies. Forcing johnny to login safely - long-term user study of forcing and training login mechanisms. In V. Atluri and C. D\u00edaz editors ESORICS 2011 volume 6879 of LNCS pages 452--471 Leuven Belgium Sept. 12--14 2011. Springer Heidelberg Germany.","DOI":"10.1007\/978-3-642-23822-2_25"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-45608-8_13"},{"key":"e_1_3_2_1_27_1","series-title":"LNCS","first-page":"150","volume-title":"B. S. Kaliski Jr.","author":"Juels A.","year":"1997"},{"key":"e_1_3_2_1_28_1","volume-title":"RFC Editor","author":"Kaliski B.","year":"2000"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516668"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"crossref","unstructured":"E.\n      Kiltz K.\n      Pietrzak D.\n      Cash A.\n      Jain and \n      D.\n      Venturi\n  . \n  Efficient authentication from hard learning problems\n  . In K. G. Paterson editor EUROCRYPT \n  2011 volume \n  6632\n   of \n  LNCS pages \n  7\n  --\n  26 Tallinn Estonia May 15--19 2011. \n  Springer Heidelberg Germany.   E. Kiltz K. Pietrzak D. Cash A. Jain and D. Venturi. Efficient authentication from hard learning problems. In K. G. Paterson editor EUROCRYPT 2011 volume 6632 of LNCS pages 7--26 Tallinn Estonia May 15--19 2011. Springer Heidelberg Germany.","DOI":"10.1007\/978-3-642-20465-4_3"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"crossref","unstructured":"P. D.\n      MacKenzie T.\n      Shrimpton and \n      M.\n      Jakobsson\n  . \n  Threshold password-authenticated key exchange\n  . In M. Yung editor CRYPTO \n  2002 volume \n  2442\n   of \n  LNCS pages \n  385\n  --\n  400 Santa Barbara CA USA Aug. 18--22 2002. \n  Springer Heidelberg Germany.   P. D. MacKenzie T. Shrimpton and M. Jakobsson. Threshold password-authenticated key exchange. In M. Yung editor CRYPTO 2002 volume 2442 of LNCS pages 385--400 Santa Barbara CA USA Aug. 18--22 2002. Springer Heidelberg Germany.","DOI":"10.1007\/3-540-45708-9_25"},{"key":"e_1_3_2_1_32_1","volume-title":"Facebook: Password hashing and authentication. https:\/\/video.adm.ntnu.no\/pres\/54b660049af94","author":"Muffet A.","year":"2015"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/795663.796378"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_5"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/11593447_1"},{"key":"e_1_3_2_1_36_1","series-title":"LNCS","first-page":"129","volume-title":"CRYPTO'91","author":"Pedersen T. P.","year":"1992"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/s001450010003"},{"key":"e_1_3_2_1_38_1","volume-title":"RSAConference Europe","author":"Robinson P.","year":"2013"},{"key":"e_1_3_2_1_39_1","volume-title":"Cryptosystem based on pairing","author":"Sakai R.","year":"2000"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30057-8_39"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"crossref","unstructured":"D.\n      Wagner\n     and \n      I.\n      Goldberg\n  . \n  Proofs of security for the Unix password hashing algorithm\n  . In T. Okamoto editor ASIACRYPT \n  2000 volume \n  1976\n   of \n  LNCS pages \n  560\n  --\n  572 Kyoto Japan Dec. 3--7 2000. \n  Springer Heidelberg Germany.   D. Wagner and I. Goldberg. Proofs of security for the Unix password hashing algorithm. In T. Okamoto editor ASIACRYPT 2000 volume 1976 of LNCS pages 560--572 Kyoto Japan Dec. 3--7 2000. Springer Heidelberg Germany.","DOI":"10.1007\/3-540-44448-3_43"},{"key":"e_1_3_2_1_42_1","volume-title":"List of data breaches -- wikipedia, the free encyclopedia","year":"2016"}],"event":{"name":"CCS'16: 2016 ACM SIGSAC Conference on Computer and Communications Security","location":"Vienna Austria","acronym":"CCS'16","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2976749.2978375","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2976749.2978375","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:40:14Z","timestamp":1750218014000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2976749.2978375"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10,24]]},"references-count":42,"alternative-id":["10.1145\/2976749.2978375","10.1145\/2976749"],"URL":"https:\/\/doi.org\/10.1145\/2976749.2978375","relation":{},"subject":[],"published":{"date-parts":[[2016,10,24]]},"assertion":[{"value":"2016-10-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}