{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T16:56:08Z","timestamp":1742921768285,"version":"3.40.3"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030883225"},{"type":"electronic","value":"9783030883232"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-88323-2_26","type":"book-chapter","created":{"date-parts":[[2021,10,17]],"date-time":"2021-10-17T12:10:22Z","timestamp":1634472622000},"page":"487-506","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Privacy Preserving OpenPGP Public Key Distribution with Spamming Resistance"],"prefix":"10.1007","author":[{"given":"Wenyuan","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingqiang","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiongxiao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenjie","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,10,18]]},"reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"CVE-2019-13050 (2019). https:\/\/nvd.nist.gov\/vuln\/detail\/CVE-2019-13050","DOI":"10.5465\/AMBPP.2019.81"},{"key":"26_CR2","unstructured":"keys.openpgp.org (2019). https:\/\/keys.openpgp.org"},{"key":"26_CR3","first-page":"27","volume":"10","author":"A Abdul-Rahman","year":"1997","unstructured":"Abdul-Rahman, A.: The pgp trust model. EDI Forum J. Electron. Commer. 10, 27\u201331 (1997)","journal-title":"EDI Forum J. Electron. Commer."},{"key":"26_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/978-3-540-74143-5_30","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"M Bellare","year":"2007","unstructured":"Bellare, M., Boldyreva, A., O\u2019Neill, A.: Deterministic and efficiently searchable encryption. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 535\u2013552. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74143-5_30"},{"issue":"7","key":"26_CR5","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"BH Bloom","year":"1970","unstructured":"Bloom, B.H.: Space\/time trade-offs in hash coding with allowable errors. Commun. ACM 13(7), 422\u2013426 (1970)","journal-title":"Commun. ACM"},{"key":"26_CR6","doi-asserted-by":"publisher","unstructured":"Camenisch, J., Fischer-H\u00fcbner, S., Rannenberg, K.: Privacy and Identity Management for Life. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20317-6","DOI":"10.1007\/978-3-642-20317-6"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Chen, H., Laine, K., Rindal, P.: Fast private set intersection from homomorphic encryption. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, pp. 1243\u20131255 (2017)","DOI":"10.1145\/3133956.3134061"},{"key":"26_CR8","unstructured":"Chor, B., Gilboa, N., Naor, M.: Private information retrieval by keywords. Citeseer (1997)"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Demmler, D., Herzberg, A., Schneider, T.: RAID-PIR: practical multi-server PIR. In: Proceedings of the 6th edition of the ACM Workshop on Cloud Computing Security, pp. 45\u201356 (2014)","DOI":"10.1145\/2664168.2664181"},{"key":"26_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/978-3-319-11203-9_22","volume-title":"Computer Security - ESORICS 2014","author":"C Dong","year":"2014","unstructured":"Dong, C., Chen, L.: A fast single server private information retrieval protocol with low communication cost. In: Kuty\u0142owski, M., Vaidya, J. (eds.) ESORICS 2014. LNCS, vol. 8712, pp. 380\u2013399. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11203-9_22"},{"key":"26_CR11","doi-asserted-by":"publisher","unstructured":"Fan, B., Andersen, D.G., Kaminsky, M., Mitzenmacher, M.D.: Cuckoo filter: practically better than bloom. In: Proceedings of the 10th ACM International on Conference on Emerging Networking Experiments and Technologies, CoNEXT 2014, pp. 75\u201388. Association for Computing Machinery, New York (2014). https:\/\/doi.org\/10.1145\/2674005.2674994","DOI":"10.1145\/2674005.2674994"},{"key":"26_CR12","doi-asserted-by":"publisher","unstructured":"Finney, H., Donnerhacke, L., Callas, J., Thayer, R.L., Shaw, D.: OpenPGP Message Format. RFC 4880 (November 2007). https:\/\/doi.org\/10.17487\/RFC4880, https:\/\/rfc-editor.org\/rfc\/rfc4880.txt","DOI":"10.17487\/RFC4880"},{"key":"26_CR13","doi-asserted-by":"publisher","unstructured":"Finney, H., Thayer, R.L., Donnerhacke, L., Callas, J.: OpenPGP Message Format. RFC 2440 (November 1998). https:\/\/doi.org\/10.17487\/RFC2440, https:\/\/rfc-editor.org\/rfc\/rfc2440.txt","DOI":"10.17487\/RFC2440"},{"issue":"4","key":"26_CR14","doi-asserted-by":"publisher","first-page":"2019","DOI":"10.1109\/COMST.2014.2321628","volume":"16","author":"M Fire","year":"2014","unstructured":"Fire, M., Goldschmidt, R., Elovici, Y.: Online social networks: threats and solutions. IEEE Commun. Surv. Tutorials 16(4), 2019\u20132036 (2014)","journal-title":"IEEE Commun. Surv. Tutorials"},{"key":"26_CR15","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":"26_CR16","unstructured":"Gentry, C., et al.: A Fully Homomorphic Encryption Scheme, vol. 20. Stanford University, Stanford (2009)"},{"key":"26_CR17","unstructured":"Gillmor, D.K.: Abuse-Resistant OpenPGP Keystores. Internet-Draft draft-dkg-openpgp-abuse-resistant-keystore-04, Internet Engineering Task Force (August 2019, work in progress). https:\/\/datatracker.ietf.org\/doc\/html\/draft-dkg-openpgp-abuse-resistant-keystore-04"},{"key":"26_CR18","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Towards a theory of software protection and simulation by oblivious rams. In: Proceedings of the 19th Annual ACM Symposium on Theory of Computing, pp. 182\u2013194 (1987)","DOI":"10.1145\/28395.28416"},{"issue":"1","key":"26_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3154793","volume":"21","author":"NZ Gong","year":"2018","unstructured":"Gong, N.Z., Liu, B.: Attribute inference attacks in online social networks. ACM Trans. Priv. Secur. (TOPS) 21(1), 1\u201330 (2018)","journal-title":"ACM Trans. Priv. Secur. (TOPS)"},{"key":"26_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-319-98113-0_13","volume-title":"Security and Cryptography for Networks","author":"R Inbar","year":"2018","unstructured":"Inbar, R., Omri, E., Pinkas, B.: Efficient scalable multiparty private set-intersection via garbled bloom filters. In: Catalano, D., De Prisco, R. (eds.) SCN 2018. LNCS, vol. 11035, pp. 235\u2013252. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98113-0_13"},{"key":"26_CR21","unstructured":"Kales, D., Rechberger, C., Schneider, T., Senker, M., Weinert, C.: Mobile private contact discovery at scale. In: 28th USENIX Security Symposium (USENIX Security 19), pp. 1447\u20131464 (2019)"},{"key":"26_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-662-45472-5_13","volume-title":"Financial Cryptography and Data Security","author":"S Kamara","year":"2014","unstructured":"Kamara, S., Mohassel, P., Raykova, M., Sadeghian, S.: Scaling private set intersection to billion-element sets. In: Christin, N., Safavi-Naini, R. (eds.) FC 2014. LNCS, vol. 8437, pp. 195\u2013215. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45472-5_13"},{"key":"26_CR23","unstructured":"Koch, W.: Gnupg 2.2.17 released to mitigate attacks on keyservers (2019). https:\/\/lists.gnupg.org\/pipermail\/gnupg-announce\/2019q3\/000439.html"},{"key":"26_CR24","unstructured":"Koch, W.: OpenPGP Web Key Directory. Internet-Draft draft-koch-openpgp-webkey-service-11, Internet Engineering Task Force (November 2020, work in progress). https:\/\/datatracker.ietf.org\/doc\/html\/draft-koch-openpgp-webkey-service-11"},{"key":"26_CR25","doi-asserted-by":"publisher","unstructured":"Krawczyk, D.H., Eronen, P.: HMAC-based Extract-and-Expand Key Derivation Function (HKDF). RFC 5869 (May 2010). https:\/\/doi.org\/10.17487\/RFC5869, https:\/\/rfc-editor.org\/rfc\/rfc5869.txt","DOI":"10.17487\/RFC5869"},{"key":"26_CR26","doi-asserted-by":"crossref","unstructured":"Krawczyk, H.: Cryptographic extraction and key derivation: the HKDF scheme. In: Annual Cryptology Conference (2010)","DOI":"10.1007\/978-3-642-14623-7_34"},{"key":"26_CR27","unstructured":"Kushilevitz, E., Ostrovsky, R.: Replication is not needed: single database, computationally-private information retrieval. In: Proceedings 38th Annual Symposium on Foundations of Computer Science, pp. 364\u2013373. IEEE (1997)"},{"key":"26_CR28","unstructured":"Minsky, Y., Trachtenberg, A.: Practical set reconciliation. In: 40th Annual Allerton Conference on Communication, Control, and Computing, vol. 248. Citeseer (2002)"},{"key":"26_CR29","doi-asserted-by":"publisher","unstructured":"Mislove, A., Marcon, M., Gummadi, K.P., Druschel, P., Bhattacharjee, B.: Measurement and analysis of online social networks. In: Proceedings of the 7th ACM SIGCOMM Conference on Internet Measurement, IMC 2007, pp. 29\u201342. Association for Computing Machinery, New York (2007). https:\/\/doi.org\/10.1145\/1298306.1298311","DOI":"10.1145\/1298306.1298311"},{"issue":"5","key":"26_CR30","doi-asserted-by":"publisher","first-page":"1254","DOI":"10.1137\/S0097539704383633","volume":"35","author":"M Naor","year":"2006","unstructured":"Naor, M., Pinkas, B.: Oblivious polynomial evaluation. SIAM J. Comput. 35(5), 1254\u20131281 (2006)","journal-title":"SIAM J. Comput."},{"issue":"2\u20133","key":"26_CR31","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1016\/j.jco.2003.08.023","volume":"20","author":"W Ogata","year":"2004","unstructured":"Ogata, W., Kurosawa, K.: Oblivious keyword search. J. Complex. 20(2\u20133), 356\u2013371 (2004)","journal-title":"J. Complex."},{"key":"26_CR32","unstructured":"Pinkas, B., Schneider, T., Segev, G., Zohner, M.: Phasing: private set intersection using permutation-based hashing. Cryptology ePrint Archive, Report 2015\/634 (2015). https:\/\/eprint.iacr.org\/2015\/634"},{"key":"26_CR33","unstructured":"Rabin, M.O.: How to exchange secrets with oblivious transfer. IACR Cryptology ePrint Archive 2005(187) (2005)"},{"issue":"4","key":"26_CR34","doi-asserted-by":"publisher","first-page":"e18384","DOI":"10.1371\/journal.pone.0018384","volume":"6","author":"O Richters","year":"2011","unstructured":"Richters, O., Peixoto, T.P.: Trust transitivity in social networks. PLOS ONE 6(4), e18384 (2011)","journal-title":"PLOS ONE"},{"key":"26_CR35","unstructured":"Shaw, D.: The OpenPGP HTTP Keyserver Protocol (HKP). Internet-Draft draft-shaw-openpgp-hkp-00, Internet Engineering Task Force (March 2003, work in progress). https:\/\/datatracker.ietf.org\/doc\/html\/draft-shaw-openpgp-hkp-00"},{"key":"26_CR36","unstructured":"Thomas, K., et al.: Protecting accounts from credential stuffing with password breach alerting. In: 28th USENIX Security Symposium (USENIX Security 19), pp. 1556\u20131571 (2019)"},{"key":"26_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/978-3-642-23822-2_27","volume-title":"Computer Security \u2013 ESORICS 2011","author":"A Ulrich","year":"2011","unstructured":"Ulrich, A., Holz, R., Hauck, P., Carle, G.: Investigating the OpenPGP web of trust. In: Atluri, V., Diaz, C. (eds.) ESORICS 2011. LNCS, vol. 6879, pp. 489\u2013507. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23822-2_27"},{"key":"26_CR38","doi-asserted-by":"publisher","unstructured":"Vesdapunt, N., Garcia-Molina, H.: Identifying users in social networks with limited information. In: 2015 IEEE 31st International Conference on Data Engineering, pp. 627\u2013638 (2015). https:\/\/doi.org\/10.1109\/ICDE.2015.7113320","DOI":"10.1109\/ICDE.2015.7113320"},{"key":"26_CR39","doi-asserted-by":"publisher","unstructured":"Wouters, P.: DNS-Based Authentication of Named Entities (DANE) Bindings for OpenPGP. RFC 7929 (August 2016). https:\/\/doi.org\/10.17487\/RFC7929, https:\/\/rfc-editor.org\/rfc\/rfc7929.txt","DOI":"10.17487\/RFC7929"},{"key":"26_CR40","unstructured":"Zimmermann, P.R.: The Official PGP User\u2019s Guide. MIT Press (1995)"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-88323-2_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,10]],"date-time":"2022-04-10T21:19:40Z","timestamp":1649625580000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-88323-2_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030883225","9783030883232"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-88323-2_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"18 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Inscrypt","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information Security and Cryptology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 August 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 August 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cisc2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cst.qd.sdu.edu.cn\/inscrypt_2021\/","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":"Hotcrp","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"81","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":"28","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":"35% - 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","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)"}}]}}