{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T20:35:13Z","timestamp":1773174913964,"version":"3.50.1"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030425036","type":"print"},{"value":"9783030425043","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-42504-3_4","type":"book-chapter","created":{"date-parts":[[2020,3,10]],"date-time":"2020-03-10T18:03:57Z","timestamp":1583863437000},"page":"45-62","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Identity Management: State of the Art, Challenges and Perspectives"],"prefix":"10.1007","author":[{"given":"Tore Kasper","family":"Frederiksen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julia","family":"Hesse","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anja","family":"Lehmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rafael","family":"Torres Moreno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,3,6]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Miao, P., Mohassel, P., Mukherjee, P.: PASTA: password-based threshold authentication. In: ACM CCS, pp. 2042\u20132059 (2018)","DOI":"10.1145\/3243734.3243839"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/3-540-45708-9_27","volume-title":"Advances in Cryptology \u2014 CRYPTO 2002","author":"J Algesheimer","year":"2002","unstructured":"Algesheimer, J., Camenisch, J., Shoup, V.: Efficient computation modulo a shared secret with application to the generation of shared safe-prime products. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 417\u2013432. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45708-9_27"},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-319-14439-9_2","volume-title":"Attribute-Based Credentials for Trust","author":"P Bichsel","year":"2015","unstructured":"Bichsel, P., et al.: An architecture for privacy-ABCs. In: Rannenberg, K., Camenisch, J., Sabouri, A. (eds.) Attribute-Based Credentials for Trust, pp. 11\u201378. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-14439-9_2"},{"issue":"4","key":"4_CR4","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1145\/502090.502094","volume":"48","author":"D Boneh","year":"2001","unstructured":"Boneh, D., Franklin, M.K.: Efficient generation of shared RSA keys. J. ACM 48(4), 702\u2013722 (2001)","journal-title":"J. ACM"},{"key":"4_CR5","unstructured":"Cadwalladr, C., Graham-Harrison, E.: Revealed: 50 million Facebook profiles harvested for Cambridge analytica in major data breach. The Guardian. https:\/\/www.theguardian.com\/news\/2018\/mar\/17\/cambridge-analytica-facebook-influence-us-election"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Herreweghen, E.V.: Design and implementation of the idemix anonymous credential system. In: ACM CCS, pp. 21\u201330 (2002)","DOI":"10.1145\/586111.586114"},{"key":"4_CR7","unstructured":"Camenisch, J., Krenn, S., Lehmann, A., Mikkelsen, G.L., Neven, G., Pedersen, M.\u00d8.: Formal treatment of privacy-enhancing credential systems. IACR Cryptology ePrint Archive 2014\/708 (2014)"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Lehmann, A., Neven, G.: Optimal distributed password verification. In: ACM CCS, pp. 182\u2013194 (2015)","DOI":"10.1145\/2810103.2813722"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/3-540-44987-6_7","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2001","author":"J Camenisch","year":"2001","unstructured":"Camenisch, J., Lysyanskaya, A.: An efficient system for non-transferable anonymous credentials with optional anonymity revocation. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 93\u2013118. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44987-6_7"},{"issue":"2","key":"4_CR10","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/358549.358563","volume":"24","author":"D Chaum","year":"1981","unstructured":"Chaum, D.: Untraceable electronic mail, return addresses, and digital pseudonyms. Commun. ACM 24(2), 84\u201388 (1981)","journal-title":"Commun. ACM"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Doerner, J., Kondi, Y., Lee, E., Shelat, A.: Threshold ECDSA from ECDSA assumptions: the multiparty case. In: IEEE Symposium on Security and Privacy, SP, pp. 1051\u20131066 (2019)","DOI":"10.1109\/SP.2019.00024"},{"key":"4_CR12","unstructured":"Everspaugh, A., Chatterjee, R., Scott, S., Juels, A., Ristenpart, T.: The Pythia PRF service. In: 24th USENIX Security Symposium pp. 547\u2013562 (2015)"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Frankel, Y., MacKenzie, P.D., Yung, M.: Robust efficient distributed RSA-Key generation. In: Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, pp. 663\u2013672 (1998)","DOI":"10.1145\/276698.276882"},{"key":"4_CR14","unstructured":"Frauenfelder, M.: \u2018I forgot my PIN\u2019: an epic tale of losing \\$30,000 in bitcoin. Wired. https:\/\/www.wired.com\/story\/i-forgot-my-pin-an-epic-tale-of-losing-dollar30000-in-bitcoin\/"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/978-3-319-96881-0_12","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"TK Frederiksen","year":"2018","unstructured":"Frederiksen, T.K., Lindell, Y., Osheter, V., Pinkas, B.: Fast distributed RSA key generation for\u00a0semi-honest and malicious adversaries. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10992, pp. 331\u2013361. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96881-0_12"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-540-30576-7_17","volume-title":"Theory of Cryptography","author":"MJ Freedman","year":"2005","unstructured":"Freedman, M.J., Ishai, Y., Pinkas, B., Reingold, O.: Keyword search and oblivious pseudorandom functions. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 303\u2013324. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30576-7_17"},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-642-20465-4_14","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"G Fuchsbauer","year":"2011","unstructured":"Fuchsbauer, G.: Commuting signatures and verifiable encryption. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 224\u2013245. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20465-4_14"},{"key":"4_CR18","unstructured":"Gennaro, R., Goldfeder, S., Ithurburn, B.: Fully distributed group signatures (2019). https:\/\/www.orbs.com\/wp-content\/uploads\/2019\/04\/Crypto_Group_signatures-2.pdf"},{"key":"4_CR19","unstructured":"Goel, V., Perlroth, N.: Yahoo says 1 billion user accounts were hacked. The New York Times. https:\/\/www.nytimes.com\/2016\/12\/14\/technology\/yahoo-hack.html"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Hardt, D.: The OAuth 2.0 Authorization Framework. RFC 6749, October 2012. https:\/\/tools.ietf.org\/html\/rfc6749","DOI":"10.17487\/rfc6749"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Honan, M.: How Apple and Amazon security flaws led to my epic hacking. Wired. https:\/\/www.wired.com\/2012\/08\/apple-amazon-mat-honan-hacking\/","DOI":"10.7312\/star16075-030"},{"key":"4_CR22","unstructured":"Hong, N., Hoffman, L., Andriotis, A.: Capital one reports data breach affecting 100 million customers, applicants. Wall Street J. https:\/\/www.wsj.com\/articles\/capital-one-reports-data-breach-11564443355"},{"key":"4_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/978-3-662-45608-8_13","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2014","author":"S Jarecki","year":"2014","unstructured":"Jarecki, S., Kiayias, A., Krawczyk, H.: Round-optimal password-protected secret sharing and T-PAKE in the password-only model. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014. LNCS, vol. 8874, pp. 233\u2013253. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45608-8_13"},{"key":"4_CR24","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1037\/a0039210","volume":"70","author":"M Kosinski","year":"2015","unstructured":"Kosinski, M., Matz, S., Gosling, S., Popov, V., Stillwell, D.: Facebook as a research tool for the social sciences. Am. Psychol. 70, 543\u2013556 (2015). https:\/\/doi.org\/10.1037\/a0039210","journal-title":"Am. Psychol."},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"Lindell, Y., Nof, A.: Fast secure multiparty ECDSA with practical distributed key generation and applications to cryptocurrency custody. In: ACM CCS, pp. 1837\u20131854 (2018)","DOI":"10.1145\/3243734.3243788"},{"key":"4_CR26","unstructured":"Newman, L.H.: Equifax officially has no excuse. Wired. https:\/\/www.wired.com\/story\/equifax-breach-no-excuse\/"},{"key":"4_CR27","unstructured":"O\u2019Flaherty, K.: Collection 1 breach - how to find out if your password has been stolen. Forbes (2019). https:\/\/www.forbes.com\/sites\/kateoflahertyuk\/2019\/01\/17\/collection-1-breach-how-to-find-out-if-your-password-has-been-stolen\/#37aa36382a2e"},{"key":"4_CR28","unstructured":"Paquin, C., Zaverucha, G.: U-prove cryptographic specification v1. 1. Technical report, Microsoft Corporation (2011)"},{"key":"4_CR29","unstructured":"Rekhter, Y., Li, T.: Security Assertion Markup Language (SAML) V2.0. OASIS, March 2015. http:\/\/saml.xml.org\/saml-specifications"},{"key":"4_CR30","doi-asserted-by":"crossref","unstructured":"Sonnino, A., Al-Bassam, M., Bano, S., Meiklejohn, S., Danezis, G.: Coconut: threshold issuance selective disclosure credentials with applications to distributed ledgers. In: Network and Distributed System Security Symposium, NDSS (2019)","DOI":"10.14722\/ndss.2019.23272"},{"key":"4_CR31","doi-asserted-by":"crossref","unstructured":"Wang, C., Jan, S.T.K., Hu, H., Bossart, D., Wang, G.: The next domino to fall: empirical analysis of user passwords across online services. In: Proceedings of CODASPY (2018)","DOI":"10.1145\/3176258.3176332"}],"container-title":["IFIP Advances in Information and Communication Technology","Privacy and Identity Management. Data for Better Living: AI and Privacy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-42504-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,10]],"date-time":"2024-03-10T01:21:51Z","timestamp":1710033711000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-42504-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030425036","9783030425043"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-42504-3_4","relation":{},"ISSN":["1868-4238","1868-422X"],"issn-type":[{"value":"1868-4238","type":"print"},{"value":"1868-422X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"6 March 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Privacy and Identity","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IFIP International Summer School on Privacy and Identity Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Windisch","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Switzerland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"privacy-identity2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.ifip-summerschool.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"22","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"71% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}