{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T01:13:05Z","timestamp":1779325985724,"version":"3.51.4"},"publisher-location":"Cham","reference-count":54,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031886607","type":"print"},{"value":"9783031886614","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-88661-4_9","type":"book-chapter","created":{"date-parts":[[2025,4,5]],"date-time":"2025-04-05T20:07:13Z","timestamp":1743883633000},"page":"198-222","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Non-interactive Threshold BBS+ from Pseudorandom Correlations"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8625-4639","authenticated-orcid":false,"given":"Sebastian","family":"Faust","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8951-5099","authenticated-orcid":false,"given":"Carmit","family":"Hazay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6556-6457","authenticated-orcid":false,"given":"David","family":"Kretzler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-7244-9593","authenticated-orcid":false,"given":"Leandro","family":"Rometsch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2798-7920","authenticated-orcid":false,"given":"Benjamin","family":"Schlosser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,4,4]]},"reference":[{"key":"9_CR1","unstructured":"Github - trinsic-id\/bbs. https:\/\/github.com\/trinsic-id\/bbs. Accessed 14 Oct 2024"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Abram, D., Nof, A., Orlandi, C., Scholl, P., Shlomovits, O.: Low-bandwidth threshold ECDSA via pseudorandom correlation generators. In: IEEE SP (2022)","DOI":"10.1109\/SP46214.2022.9833559"},{"key":"9_CR3","unstructured":"Algorand. BLS12-381 Rust crate. https:\/\/github.com\/algorand\/pairing-plus. Accessed 14 Oct 2024"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Au, M.H., Susilo, W., Mu, Y., Chow, S.S.M.: Constant-size dynamic $$k$$ -times anonymous authentication. IEEE Syst. J. (2013)","DOI":"10.1109\/JSYST.2012.2221931"},{"key":"9_CR5","unstructured":"Aumasson, J-P., Hamelink, A., Shlomovits, O.: A survey of ECDSA threshold signing. IACR Cryptol. ePrint Arch. (2020)"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Bar-Ilan, J., Beaver, D.: Non-cryptographic fault-tolerant computing in constant number of rounds of interaction. In: PODC (1989)","DOI":"10.1145\/72981.72995"},{"key":"9_CR7","unstructured":"Beaver, D.: Efficient multiparty protocols using circuit randomization. In: CRYPTO (1991)"},{"key":"9_CR8","unstructured":"Bernstein, G., Sporny, M.: Data integrity bbs cryptosuites v1.0 (2024). https:\/\/w3c.github.io\/vc-di-bbs\/. Accessed 14 Oct 2024"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Bl\u00f6mer, J., Bobolz, J., Diemert, D., Eidens, F.: Updatable anonymous credentials and applications to incentive systems. In: CCS (2019)","DOI":"10.1145\/3319535.3354223"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Boneh, D., Boyen, X., Shacham, H.: Short group signatures. In: CRYPTO (2004)","DOI":"10.1007\/978-3-540-28628-8_3"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Boneh, D., Franklin, M.K.: Identity-based encryption from the weil pairing. In: CRYPTO (2001)","DOI":"10.1007\/3-540-44647-8_13"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y.: Compressing vector OLE. In: CCS (2018)","DOI":"10.1145\/3243734.3243868"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Boyle, E., ET AL.: Efficient two-round OT extension and silent non-interactive secure computation. In: CCS (2019)","DOI":"10.1145\/3319535.3354255"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Scholl, P.: Efficient pseudorandom correlation generators: silent OT extension and more. In: CRYPTO (2019)","DOI":"10.1007\/978-3-030-26954-8_16"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Scholl, P.: Correlated pseudorandom functions from variable-density LPN. In: FOCS (2020)","DOI":"10.1109\/FOCS46700.2020.00103"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Scholl, P.: Efficient pseudorandom correlation generators from ring-LPN. In: CRYPTO (2020)","DOI":"10.1007\/978-3-030-56880-1_14"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Brickell, E., Li, J.: Enhanced privacy ID from bilinear pairing for hardware authentication and attestation. Int. J. Inf. Priv. Secur. Integr. (2011)","DOI":"10.1504\/IJIPSI.2011.043729"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Drijvers, M., Lehmann, A.: Anonymous attestation using the strong Diffie Hellman assumption revisited. In: TRUST (2016)","DOI":"10.1007\/978-3-319-45572-3_1"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Dubovitskaya, M., Haralambiev, K., Kohlweiss, M.: Composable and modular anonymous credentials: definitions and practical constructions. In: ASIACRYPT (2015)","DOI":"10.1007\/978-3-662-48800-3_11"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Lysyanskaya, A.: An efficient system for non-transferable anonymous credentials with optional anonymity revocation. In: EUROCRYPT (2001)","DOI":"10.1007\/3-540-44987-6_7"},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Lysyanskaya, A.: Signature schemes and anonymous credentials from bilinear maps. In: CRYPTO (2004)","DOI":"10.1007\/978-3-540-28628-8_4"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: FOCS (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"Canetti, R., Gennaro, R., Goldfeder, S., Makriyannis, N., Peled, U.: UC non-interactive, proactive, threshold ECDSA with identifiable aborts. In: CCS (2020)","DOI":"10.1145\/3372297.3423367"},{"key":"9_CR24","doi-asserted-by":"crossref","unstructured":"Castagnos, G., Laguillaumie, F., Tucker, I.: Threshold linearly homomorphic encryption on $$\\textbf{Z}\/2^k\\textbf{Z}$$. In: ASIACRYPT (2022)","DOI":"10.1007\/978-3-031-22966-4_4"},{"key":"9_CR25","doi-asserted-by":"crossref","unstructured":"Chaum, D.: Security without identification: transaction systems to make big brother obsolete. ACM Commun. (1985)","DOI":"10.1145\/4372.4373"},{"key":"9_CR26","doi-asserted-by":"crossref","unstructured":"Chu, H., Gerhart, P., Ruffing, T., Schr\u00f6der, D.: Practical schnorr threshold signatures without the algebraic group model. In: CRYPTO (2023)","DOI":"10.1007\/978-3-031-38557-5_24"},{"key":"9_CR27","doi-asserted-by":"crossref","unstructured":"Couteau, G., Rindal, P., Raghuraman, S.: Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes. In: CRYPTO (2021)","DOI":"10.1007\/978-3-030-84252-9_17"},{"key":"9_CR28","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Pastro, V., Smart, N.P., Zakarias, S.: Multiparty computation from somewhat homomorphic encryption. In: CRYPTO (2012)","DOI":"10.1007\/978-3-642-32009-5_38"},{"key":"9_CR29","unstructured":"Phanekham, R.J.D.: How much is google cloud latency (GCP) between regions? (2020). https:\/\/cloud.google.com\/blog\/products\/networking\/using-netperf-and-ping-to-measure-network-latency. Accessed 14 Oct 2024"},{"key":"9_CR30","doi-asserted-by":"crossref","unstructured":"Doerner, J., Kondi, Y., Lee, E., Shelat, A., Tyner, L.: Threshold BBS+ signatures for distributed anonymous credential issuance. In: IEEE SP (2023)","DOI":"10.1109\/SP46215.2023.10179470"},{"issue":"1","key":"9_CR31","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/BF02254791","volume":"9","author":"S Even","year":"1996","unstructured":"Even, S., Goldreich, O., Micali, S.: On-line\/off-line digital signatures. J. Cryptol. 9(1), 35\u201367 (1996). https:\/\/doi.org\/10.1007\/BF02254791","journal-title":"J. Cryptol."},{"key":"9_CR32","unstructured":"Faust, S., Hazay, C., Kretzler, D., Rometsch, L., Schlosser, B.: Non-interactive threshold BBS+ from pseudorandom correlations. Cryptology ePrint Archive, Paper 2023\/1076 (2023). https:\/\/eprint.iacr.org\/2023\/1076"},{"key":"9_CR33","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Goldfeder, S.: Fast multiparty threshold ECDSA with fast trustless setup. In: CCS (2018)","DOI":"10.1145\/3243734.3243859"},{"key":"9_CR34","unstructured":"Gennaro, R., Goldfeder, S., Ithurburn, B.: Fully distributed group signatures (2019)"},{"key":"9_CR35","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Secure distributed key generation for discrete-log based cryptosystems. In: EUROCRYPT (1999)","DOI":"10.1007\/3-540-48910-X_21"},{"key":"9_CR36","doi-asserted-by":"crossref","unstructured":"Kondi, Y., Orlandi, C., Roy, L.: Two-round stateless deterministic two-party schnorr signatures from pseudorandom correlation functions. In: CRYPTO (2023)","DOI":"10.1007\/978-3-031-38557-5_21"},{"key":"9_CR37","unstructured":"Kumar, C.: How much is google cloud latency (GCP) between regions? (2022). https:\/\/geekflare.com\/google-cloud-latency\/. Accessed 14 Oct 2024"},{"key":"9_CR38","unstructured":"Looker, T., Kalos, V., Whitehead, A., Lodder, M.: The BBS Signature Scheme. Internet-Draft draft-irtf-cfrg-bbs-signatures-02, Internet Engineering Task Force (2023). (Work in Progress)"},{"key":"9_CR39","doi-asserted-by":"crossref","unstructured":"Lysyanskaya, A., Rivest, R.L., Sahai, A., Wolf, S.: Pseudonym systems. In: SAC (1999)","DOI":"10.1007\/3-540-46513-8_14"},{"key":"9_CR40","unstructured":"MATTR. mattrglobal\/bbs-signatures: an implementation of bbs+ signatures for node and browser environments. https:\/\/github.com\/mattrglobal\/bbs-signatures. Accessed 14 Oct 2024"},{"key":"9_CR41","unstructured":"Microsoft. microsoft\/bbs-node-reference: Typescript\/node reference implementation of bbs signature. https:\/\/github.com\/microsoft\/bbs-node-reference. Accessed 14 Oct 2024"},{"key":"9_CR42","doi-asserted-by":"crossref","unstructured":"Nielsen, J.B., Nordholt, P.S., Orlandi, C., Burra, S.S.: A new approach to practical active-secure two-party computation. In: CRYPTO (2012)","DOI":"10.1007\/978-3-642-32009-5_40"},{"key":"9_CR43","doi-asserted-by":"crossref","unstructured":"Orlandi, C., Scholl, P., Yakoubov, S.: The rise of paillier homomorphic secret sharing and public-key silent OT. In: EUROCRYPT (2021)","DOI":"10.1007\/978-3-030-77870-5_24"},{"key":"9_CR44","doi-asserted-by":"crossref","unstructured":"Pointcheval, D., Sanders, O.: Short randomizable signatures. In: CT-RSA (2016)","DOI":"10.1007\/978-3-319-29485-8_7"},{"key":"9_CR45","unstructured":"Rial, A., Piotrowska, A.M.: Security analysis of coconut, an attribute-based credential scheme with threshold issuance. IACR Cryptol. ePrint Arch (2022)"},{"key":"9_CR46","doi-asserted-by":"crossref","unstructured":"Shamir, A.: How to share a secret. Commun. ACM (1979)","DOI":"10.1145\/359168.359176"},{"key":"9_CR47","doi-asserted-by":"crossref","unstructured":"Smart, N.P., Talibi Alaoui, Y.: Distributing any elliptic curve based protocol. In: IMA (2019)","DOI":"10.1007\/978-3-030-35199-1_17"},{"key":"9_CR48","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: NDSS (2019)","DOI":"10.14722\/ndss.2019.23272"},{"key":"9_CR49","doi-asserted-by":"crossref","unstructured":"Tessaro, S., Zhu, C.: Revisiting BBS signatures. In: EUROCRYPT (2023)","DOI":"10.1007\/978-3-031-30589-4_24"},{"key":"9_CR50","doi-asserted-by":"crossref","unstructured":"Wang, X., Ranellucci, S., Katz, J.: Authenticated garbling and efficient maliciously secure two-party computation. In: CCS (2017)","DOI":"10.1145\/3133956.3134053"},{"key":"9_CR51","doi-asserted-by":"crossref","unstructured":"Wang, X., Ranellucci, S., Katz, J.: Global-scale secure multiparty computation. In: CCS (2017)","DOI":"10.1145\/3133956.3133979"},{"key":"9_CR52","doi-asserted-by":"crossref","unstructured":"Wikstr\u00f6m, D.: Universally composable DKG with linear number of exponentiations. In: SCN (2004)","DOI":"10.1007\/978-3-540-30598-9_19"},{"key":"9_CR53","doi-asserted-by":"crossref","unstructured":"Wong, H.W.H., Ma, J.P.K., Chow, S.S.M.: Secure multiparty computation of threshold signatures made more efficient. In: NDSS (2024)","DOI":"10.14722\/ndss.2024.24601"},{"key":"9_CR54","doi-asserted-by":"crossref","unstructured":"Yu, Z., Au, M.H., Yang, R.: Accountable anonymous credentials. In: Advances in Cyber Security: Principles, Techniques, and Applications (2019)","DOI":"10.1007\/978-981-13-1483-4_3"}],"container-title":["Lecture Notes in Computer Science","Topics in Cryptology \u2013 CT-RSA 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-88661-4_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,5]],"date-time":"2025-04-05T20:07:32Z","timestamp":1743883652000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-88661-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031886607","9783031886614"],"references-count":54,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-88661-4_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"4 April 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"CT-RSA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cryptographers\u2019 Track at the RSA Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"San Francisco, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 April 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 May 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ctrsa2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ct-rsa-2025.csa.iisc.ac.in","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}