{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T15:49:27Z","timestamp":1783007367817,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,5,30]],"date-time":"2022-05-30T00:00:00Z","timestamp":1653868800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"German Research Foundation DFG","award":["SFB 1119 - 236615297"],"award-info":[{"award-number":["SFB 1119 - 236615297"]}]},{"name":"EU Horizon 2020 research and innovation programme","award":["786725 OLYMPUS"],"award-info":[{"award-number":["786725 OLYMPUS"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,5,30]]},"DOI":"10.1145\/3488932.3517389","type":"proceedings-article","created":{"date-parts":[[2022,5,24]],"date-time":"2022-05-24T04:23:26Z","timestamp":1653366206000},"page":"682-696","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":22,"title":["DPaSE"],"prefix":"10.1145","author":[{"given":"Poulami","family":"Das","sequence":"first","affiliation":[{"name":"TU Darmstadt, Darmstadt, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Julia","family":"Hesse","sequence":"additional","affiliation":[{"name":"IBM Research Europe, Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anja","family":"Lehmann","sequence":"additional","affiliation":[{"name":"Hasso-Plattner-Institute, University of Potsdam, Potsdam, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,5,30]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"[n. d.]. DPaSE PoC Implementation. https:\/\/gitlab.com\/DPaSEcode\/dpase- submission-code.  [n. d.]. DPaSE PoC Implementation. https:\/\/gitlab.com\/DPaSEcode\/dpase- submission-code."},{"key":"e_1_3_2_2_2_1","unstructured":"[n. d.]. Internet Identity: The End of Usernames and Passwords. https:\/\/tinyurl. com\/6rrhvzr2.  [n. d.]. Internet Identity: The End of Usernames and Passwords. https:\/\/tinyurl. com\/6rrhvzr2."},{"key":"e_1_3_2_2_3_1","unstructured":"[n. d.]. MEGA: Secure Cloud Storage and Communication Privacy by Design. https:\/\/mega.nz\/.  [n. d.]. MEGA: Secure Cloud Storage and Communication Privacy by Design. https:\/\/mega.nz\/."},{"key":"e_1_3_2_2_4_1","unstructured":"[n. d.]. Tresorit: Cloud Storage + End-to-end Encryption. https:\/\/tresorit.com\/ security\/encryption.  [n. d.]. Tresorit: Cloud Storage + End-to-end Encryption. https:\/\/tresorit.com\/ security\/encryption."},{"key":"#cr-split#-e_1_3_2_2_5_1.1","doi-asserted-by":"crossref","unstructured":"Shashank Agrawal Payman Mohassel Pratyay Mukherjee and Peter Rindal. 2018. DiSE: Distributed Symmetric-key Encryption. 1993--2010. https:\/\/doi.org\/10.1145\/3243734.3243774 10.1145\/3243734.3243774","DOI":"10.1145\/3243734.3243774"},{"key":"#cr-split#-e_1_3_2_2_5_1.2","doi-asserted-by":"crossref","unstructured":"Shashank Agrawal Payman Mohassel Pratyay Mukherjee and Peter Rindal. 2018. DiSE: Distributed Symmetric-key Encryption. 1993--2010. https:\/\/doi.org\/10.1145\/3243734.3243774","DOI":"10.1145\/3243734.3243774"},{"key":"#cr-split#-e_1_3_2_2_6_1.1","doi-asserted-by":"crossref","unstructured":"Ali Bagherzandi Stanislaw Jarecki Nitesh Saxena and Yanbin Lu. 2011. Password-protected secret sharing. 433--444. https:\/\/doi.org\/10.1145\/2046707.2046758 10.1145\/2046707.2046758","DOI":"10.1145\/2046707.2046758"},{"key":"#cr-split#-e_1_3_2_2_6_1.2","doi-asserted-by":"crossref","unstructured":"Ali Bagherzandi Stanislaw Jarecki Nitesh Saxena and Yanbin Lu. 2011. Password-protected secret sharing. 433--444. https:\/\/doi.org\/10.1145\/2046707.2046758","DOI":"10.1145\/2046707.2046758"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/EuroSP48549.2020.00044"},{"key":"e_1_3_2_2_8_1","volume-title":"Threshold Password-Hardened Encryption Services. In CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security. https:\/\/doi.org\/10","author":"Brost Julian","year":"2020","unstructured":"Julian Brost , Christoph Egger , Russell W. F. Lai , Fritz Schmid , Dominique Schr\u00f6 der, and Markus Zoppelt . 2020 . Threshold Password-Hardened Encryption Services. In CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security. https:\/\/doi.org\/10 .1145\/3372297.3417266 10.1145\/3372297.3417266 Julian Brost, Christoph Egger, Russell W. F. Lai, Fritz Schmid, Dominique Schr\u00f6 der, and Markus Zoppelt. 2020. Threshold Password-Hardened Encryption Services. In CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security. https:\/\/doi.org\/10.1145\/3372297.3417266"},{"key":"e_1_3_2_2_9_1","volume-title":"Privacy-Preserving User-Auditable Pseudonym Systems. In 2017 IEEE European Symposium on Security and Privacy, Euro S&P. IEEE.","author":"Camenisch Jan","year":"2017","unstructured":"Jan Camenisch and Anja Lehmann . 2017 . Privacy-Preserving User-Auditable Pseudonym Systems. In 2017 IEEE European Symposium on Security and Privacy, Euro S&P. IEEE. Jan Camenisch and Anja Lehmann. 2017. Privacy-Preserving User-Auditable Pseudonym Systems. In 2017 IEEE European Symposium on Security and Privacy, Euro S&P. IEEE."},{"key":"e_1_3_2_2_10_1","volume-title":"Memento: How to Reconstruct Your Secrets from a Single Password in a Hostile Environment. 256--275. https:\/\/doi.org\/10.1007\/978-3-662-44381-1_15","author":"Camenisch Jan","year":"2014","unstructured":"Jan Camenisch , Anja Lehmann , Anna Lysyanskaya , and Gregory Neven . 2014 . Memento: How to Reconstruct Your Secrets from a Single Password in a Hostile Environment. 256--275. https:\/\/doi.org\/10.1007\/978-3-662-44381-1_15 10.1007\/978-3-662-44381-1_15 Jan Camenisch, Anja Lehmann, Anna Lysyanskaya, and Gregory Neven. 2014. Memento: How to Reconstruct Your Secrets from a Single Password in a Hostile Environment. 256--275. https:\/\/doi.org\/10.1007\/978-3-662-44381-1_15"},{"key":"#cr-split#-e_1_3_2_2_11_1.1","doi-asserted-by":"crossref","unstructured":"Jan Camenisch Anja Lehmann and Gregory Neven. 2015. Optimal Distributed Password Verification. 182--194. https:\/\/doi.org\/10.1145\/2810103.2813722 10.1145\/2810103.2813722","DOI":"10.1145\/2810103.2813722"},{"key":"#cr-split#-e_1_3_2_2_11_1.2","doi-asserted-by":"crossref","unstructured":"Jan Camenisch Anja Lehmann and Gregory Neven. 2015. Optimal Distributed Password Verification. 182--194. https:\/\/doi.org\/10.1145\/2810103.2813722","DOI":"10.1145\/2810103.2813722"},{"key":"#cr-split#-e_1_3_2_2_12_1.1","doi-asserted-by":"crossref","unstructured":"Ran Canetti. 2001. Universally Composable Security: A New Paradigm for Cryptographic Protocols. 136--145. https:\/\/doi.org\/10.1109\/SFCS.2001.959888 10.1109\/SFCS.2001.959888","DOI":"10.1109\/SFCS.2001.959888"},{"key":"#cr-split#-e_1_3_2_2_12_1.2","doi-asserted-by":"crossref","unstructured":"Ran Canetti. 2001. Universally Composable Security: A New Paradigm for Cryptographic Protocols. 136--145. https:\/\/doi.org\/10.1109\/SFCS.2001.959888","DOI":"10.1109\/SFCS.2001.959888"},{"key":"#cr-split#-e_1_3_2_2_13_1.1","doi-asserted-by":"crossref","unstructured":"Mihai Christodorescu Sivanarayana Gaddam Pratyay Mukherjee and Rohit Sinha. 2021. Amortized Threshold Symmetric-key Encryption. In CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security Yongdae Kim Jong Kim Giovanni Vigna and Elaine Shi (Eds.). https:\/\/doi.org\/10.1145\/3460120.3485256 10.1145\/3460120.3485256","DOI":"10.1145\/3460120.3485256"},{"key":"#cr-split#-e_1_3_2_2_13_1.2","doi-asserted-by":"crossref","unstructured":"Mihai Christodorescu Sivanarayana Gaddam Pratyay Mukherjee and Rohit Sinha. 2021. Amortized Threshold Symmetric-key Encryption. In CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security Yongdae Kim Jong Kim Giovanni Vigna and Elaine Shi (Eds.). https:\/\/doi.org\/10.1145\/3460120.3485256","DOI":"10.1145\/3460120.3485256"},{"key":"e_1_3_2_2_14_1","unstructured":"Adam Everspaugh Rahul Chatterjee Samuel Scott Ari Juels and Thomas Ristenpart. 2015. The Pythia PRF Service. 547--562.  Adam Everspaugh Rahul Chatterjee Samuel Scott Ari Juels and Thomas Ristenpart. 2015. The Pythia PRF Service. 547--562."},{"key":"e_1_3_2_2_15_1","unstructured":"Mohammad Saiful Islam Mehmet Kuzu and Murat Kantarcioglu. 2012. Access Pattern disclosure on Searchable Encryption: Ramification Attack and Mitigation.  Mohammad Saiful Islam Mehmet Kuzu and Murat Kantarcioglu. 2012. Access Pattern disclosure on Searchable Encryption: Ramification Attack and Mitigation."},{"key":"#cr-split#-e_1_3_2_2_16_1.1","doi-asserted-by":"crossref","unstructured":"Stanislaw Jarecki Aggelos Kiayias and Hugo Krawczyk. 2014. Round-Optimal Password-Protected Secret Sharing and T-PAKE in the Password-Only Model. 233--253. https:\/\/doi.org\/10.1007\/978-3-662-45608-8_13 10.1007\/978-3-662-45608-8_13","DOI":"10.1007\/978-3-662-45608-8_13"},{"key":"#cr-split#-e_1_3_2_2_16_1.2","doi-asserted-by":"crossref","unstructured":"Stanislaw Jarecki Aggelos Kiayias and Hugo Krawczyk. 2014. Round-Optimal Password-Protected Secret Sharing and T-PAKE in the Password-Only Model. 233--253. https:\/\/doi.org\/10.1007\/978-3-662-45608-8_13","DOI":"10.1007\/978-3-662-45608-8_13"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/EuroSP.2016.30"},{"key":"e_1_3_2_2_18_1","volume-title":"TOPPSS: Cost-Minimal Password-Protected Secret Sharing Based on Threshold OPRF. 39--58. https:\/\/doi.org\/10.1007\/978-3-319-61204-1_3","author":"Jarecki Stanislaw","year":"2017","unstructured":"Stanislaw Jarecki , Aggelos Kiayias , Hugo Krawczyk , and Jiayu Xu . 2017 . TOPPSS: Cost-Minimal Password-Protected Secret Sharing Based on Threshold OPRF. 39--58. https:\/\/doi.org\/10.1007\/978-3-319-61204-1_3 10.1007\/978-3-319-61204-1_3 Stanislaw Jarecki, Aggelos Kiayias, Hugo Krawczyk, and Jiayu Xu. 2017. TOPPSS: Cost-Minimal Password-Protected Secret Sharing Based on Threshold OPRF. 39--58. https:\/\/doi.org\/10.1007\/978-3-319-61204-1_3"},{"key":"e_1_3_2_2_19_1","volume-title":"Resch","author":"Jarecki Stanislaw","year":"2019","unstructured":"Stanislaw Jarecki , Hugo Krawczyk , and Jason K . Resch . 2019 . Updatable Oblivious Key Management for Storage Systems . 379--393. https:\/\/doi.org\/10.1145\/3319535.3363196 10.1145\/3319535.3363196 Stanislaw Jarecki, Hugo Krawczyk, and Jason K. Resch. 2019. Updatable Oblivious Key Management for Storage Systems. 379--393. https:\/\/doi.org\/10.1145\/3319535.3363196"},{"key":"e_1_3_2_2_20_1","volume-title":"OPAQUE: An Asymmetric PAKE Protocol Secure Against Pre-computation Attacks. 456--486. https:\/\/doi.org\/10.1007\/978-3-319-78372-7_15","author":"Jarecki Stanislaw","year":"2018","unstructured":"Stanislaw Jarecki , Hugo Krawczyk , and Jiayu Xu . 2018 . OPAQUE: An Asymmetric PAKE Protocol Secure Against Pre-computation Attacks. 456--486. https:\/\/doi.org\/10.1007\/978-3-319-78372-7_15 10.1007\/978-3-319-78372-7_15 Stanislaw Jarecki, Hugo Krawczyk, and Jiayu Xu. 2018. OPAQUE: An Asymmetric PAKE Protocol Secure Against Pre-computation Attacks. 456--486. https:\/\/doi.org\/10.1007\/978-3-319-78372-7_15"},{"key":"#cr-split#-e_1_3_2_2_21_1.1","doi-asserted-by":"crossref","unstructured":"Stanislaw Jarecki and Xiaomin Liu. 2009. Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection. 577--594. https:\/\/doi.org\/10.1007\/978-3-642-00457-5_34 10.1007\/978-3-642-00457-5_34","DOI":"10.1007\/978-3-642-00457-5_34"},{"key":"#cr-split#-e_1_3_2_2_21_1.2","doi-asserted-by":"crossref","unstructured":"Stanislaw Jarecki and Xiaomin Liu. 2009. Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection. 577--594. https:\/\/doi.org\/10.1007\/978-3-642-00457-5_34","DOI":"10.1007\/978-3-642-00457-5_34"},{"key":"#cr-split#-e_1_3_2_2_22_1.1","doi-asserted-by":"crossref","unstructured":"Michael Kloo\u00df Anja Lehmann and Andy Rupp. 2019. (R)CCA Secure Updatable Encryption with Integrity Protection. 68--99. https:\/\/doi.org\/10.1007\/978-3-030-17653-2_3 10.1007\/978-3-030-17653-2_3","DOI":"10.1007\/978-3-030-17653-2_3"},{"key":"#cr-split#-e_1_3_2_2_22_1.2","doi-asserted-by":"crossref","unstructured":"Michael Kloo\u00df Anja Lehmann and Andy Rupp. 2019. (R)CCA Secure Updatable Encryption with Integrity Protection. 68--99. https:\/\/doi.org\/10.1007\/978-3-030-17653-2_3","DOI":"10.1007\/978-3-030-17653-2_3"},{"key":"#cr-split#-e_1_3_2_2_23_1.1","doi-asserted-by":"crossref","unstructured":"Vladimir Kolesnikov Ranjit Kumaresan Mike Rosulek and Ni Trieu. 2016. Efficient Batched Oblivious PRF with Applications to Private Set Intersection. 818--829. https:\/\/doi.org\/10.1145\/2976749.2978381 10.1145\/2976749.2978381","DOI":"10.1145\/2976749.2978381"},{"key":"#cr-split#-e_1_3_2_2_23_1.2","doi-asserted-by":"crossref","unstructured":"Vladimir Kolesnikov Ranjit Kumaresan Mike Rosulek and Ni Trieu. 2016. Efficient Batched Oblivious PRF with Applications to Private Set Intersection. 818--829. https:\/\/doi.org\/10.1145\/2976749.2978381","DOI":"10.1145\/2976749.2978381"},{"key":"e_1_3_2_2_24_1","volume-title":"Paterson","author":"Lacharit\u00e9 Marie-Sarah","year":"2018","unstructured":"Marie-Sarah Lacharit\u00e9 , Brice Minaud , and Kenneth G . Paterson . 2018 . Improved Reconstruction Attacks on Encrypted Data Using Range Query Leakage . 297--314. https:\/\/doi.org\/10.1109\/SP.2018.00002 10.1109\/SP.2018.00002 Marie-Sarah Lacharit\u00e9, Brice Minaud, and Kenneth G. Paterson. 2018. Improved Reconstruction Attacks on Encrypted Data Using Range Query Leakage. 297--314. https:\/\/doi.org\/10.1109\/SP.2018.00002"},{"key":"e_1_3_2_2_25_1","volume-title":"Simple Password-Hardened Encryption Services. In 27th USENIX Security Symposium, USENIX Security. https:\/\/www.usenix.org\/conference\/usenixsecurity18\/presentation\/lai","author":"Lai Russell W. F.","year":"2018","unstructured":"Russell W. F. Lai , Christoph Egger , Manuel Reinert , Sherman S. M. Chow , Matteo Maffei , and Dominique Schr\u00f6der . 2018 . Simple Password-Hardened Encryption Services. In 27th USENIX Security Symposium, USENIX Security. https:\/\/www.usenix.org\/conference\/usenixsecurity18\/presentation\/lai Russell W. F. Lai, Christoph Egger, Manuel Reinert, Sherman S. M. Chow, Matteo Maffei, and Dominique Schr\u00f6der. 2018. Simple Password-Hardened Encryption Services. In 27th USENIX Security Symposium, USENIX Security. https:\/\/www.usenix.org\/conference\/usenixsecurity18\/presentation\/lai"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.2478\/popets-2019-0048"},{"key":"#cr-split#-e_1_3_2_2_27_1.1","doi-asserted-by":"crossref","unstructured":"Anja Lehmann and Bj\u00f6rn Tackmann. 2018. Updatable Encryption with Post-Compromise Security. 685--716. https:\/\/doi.org\/10.1007\/978-3-319-78372-7_22 10.1007\/978-3-319-78372-7_22","DOI":"10.1007\/978-3-319-78372-7_22"},{"key":"#cr-split#-e_1_3_2_2_27_1.2","doi-asserted-by":"crossref","unstructured":"Anja Lehmann and Bj\u00f6rn Tackmann. 2018. Updatable Encryption with Post-Compromise Security. 685--716. https:\/\/doi.org\/10.1007\/978-3-319-78372-7_22","DOI":"10.1007\/978-3-319-78372-7_22"},{"key":"e_1_3_2_2_28_1","volume-title":"Robust distributed symmetric-key encryption. IACR ePrint","author":"Wang Xunhua","year":"2020","unstructured":"Xunhua Wang and Ben Huson . 2020. Robust distributed symmetric-key encryption. IACR ePrint ( 2020 ). Xunhua Wang and Ben Huson. 2020. Robust distributed symmetric-key encryption. IACR ePrint (2020)."}],"event":{"name":"ASIA CCS '22: ACM Asia Conference on Computer and Communications Security","location":"Nagasaki Japan","acronym":"ASIA CCS '22","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2022 ACM on Asia Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3488932.3517389","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3488932.3517389","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:48:29Z","timestamp":1750193309000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3488932.3517389"}},"subtitle":["Distributed Password-Authenticated Symmetric-Key Encryption, or How to Get Many Keys from One Password"],"short-title":[],"issued":{"date-parts":[[2022,5,30]]},"references-count":38,"alternative-id":["10.1145\/3488932.3517389","10.1145\/3488932"],"URL":"https:\/\/doi.org\/10.1145\/3488932.3517389","relation":{},"subject":[],"published":{"date-parts":[[2022,5,30]]},"assertion":[{"value":"2022-05-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}