{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T14:24:26Z","timestamp":1742394266225},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2004,11,1]],"date-time":"2004-11-01T00:00:00Z","timestamp":1099267200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IJIS"],"published-print":{"date-parts":[[2004,11]]},"DOI":"10.1007\/s10207-004-0043-y","type":"journal-article","created":{"date-parts":[[2004,9,20]],"date-time":"2004-09-20T07:18:15Z","timestamp":1095664695000},"page":"61-69","source":"Crossref","is-referenced-by-count":3,"title":["Protocols useful on the Internet from distributed signature schemes"],"prefix":"10.1007","volume":"3","author":[{"given":"Vanesa","family":"Daza","sequence":"first","affiliation":[]},{"given":"Javier","family":"Herranz","sequence":"additional","affiliation":[]},{"given":"Germ\u00e1n","family":"S\u00e1ez","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2004,11,1]]},"reference":[{"key":"43_CR1","doi-asserted-by":"crossref","unstructured":"Bellare M, Rogaway P (1993) Random oracles are practical: a paradigm for designing efficient protocols. In: Proceedings of the 1st ACM conference on computer and communications security (CCS\u201993), pp 62\u201373","DOI":"10.1145\/168588.168596"},{"key":"43_CR2","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/S0020-0190(02)00321-6","volume":"84","author":"Blundo","year":"2002","unstructured":"Blundo C, Cimato S, Masucci B (2002) A note on optimal metering schemes. Inf Process Lett 84(6):319\u2013326","journal-title":"Inf Process Lett"},{"key":"43_CR3","doi-asserted-by":"crossref","unstructured":"Blundo C, D\u2019Arco P, Daza V, Padr\u00f3 C (2001) Bounds and constructions for unconditionally secure distributed key distribution schemes with general access structures. In: Davida GI, Frankel Y (eds) Proceedings of the conference on information security (ISC\u201901). Lecture notes in computer science, vol 2200. Springer, Berlin Heidelberg New York, pp 1\u201317","DOI":"10.1007\/3-540-45439-X_1"},{"key":"43_CR4","doi-asserted-by":"crossref","unstructured":"Boldyreva A (2003) Threshold signatures, multisignatures and blind signatures based on the Gap-Diffie-Hellman-group signature scheme. In: Desmedt YG (ed) Proceedings of the workshop on public key cryptography (PKC\u201903). Lecture notes in computer science, vol 2567. Springer, Berlin Heidelberg New York, pp 31\u201346","DOI":"10.1007\/3-540-36288-6_3"},{"key":"43_CR5","doi-asserted-by":"crossref","unstructured":"Boneh D, Franklin M (1997) Efficient generation of shared RSA keys. In: Kaliski B (ed) Advances in Cryptology-Crypto\u201997. Lecture notes in computer science, vol 1294. Springer, Berlin Heidelberg New York, pp 425\u2013439","DOI":"10.1007\/BFb0052253"},{"key":"43_CR6","doi-asserted-by":"crossref","unstructured":"Catalano D, Gennaro R, Halevi S (2000) Computing inverses over a shared secret modulus. In: Preneel B (ed) Advances in Cryptology-Eurocrypt\u201900. Lecture notes in computer science, vol 1807. Springer, Berlin Heidelberg New York, pp 190\u2013206","DOI":"10.1007\/3-540-45539-6_14"},{"key":"43_CR7","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd I, Koprowski M (2001) Practical threshold RSA signatures without a trusted dealer. In: Pfitzmann B (ed) Advances in Cryptology-Eurocrypt\u201901. Lecture notes in computer science, vol 2045. Springer, Berlin Heidelberg New York, pp 152\u2013165","DOI":"10.1007\/3-540-44987-6_10"},{"key":"43_CR8","doi-asserted-by":"crossref","unstructured":"D\u2019Arco P, Stinson DR (2002) On unconditionally secure robust distributed key distribution centers. In: Zheng Y (ed) Advances in Cryptology-Asiacrypt\u201902. Lecture notes in computer science, vol 2501. Springer, Berlin Heidelberg New York, pp 346\u2013363","DOI":"10.1007\/3-540-36178-2_22"},{"key":"43_CR9","doi-asserted-by":"crossref","unstructured":"Daza V, Herranz J, Padr\u00f3 C, S\u00e1ez G (2002) A distributed and computationally secure key distribution scheme. In: Chan A, Gligor V (eds) Proceedings of the conference on information security (ISC\u201902). Lecture notes in computer science, vol 2433. Springer, Berlin Heidelberg New York, pp 342\u2013356","DOI":"10.1007\/3-540-45811-5_27"},{"key":"43_CR10","doi-asserted-by":"crossref","unstructured":"Daza V, Herranz J, S\u00e1ez G (2003) Some protocols useful on the Internet from threshold signature schemes. In: Proceedings of the workshop on trust and privacy in digital business (TrustBus\u201903). IEEE Press, New York, pp 359\u2013363","DOI":"10.1109\/DEXA.2003.1232048"},{"key":"43_CR11","doi-asserted-by":"crossref","unstructured":"Fouque PA, Stern J (2001) Fully distributed threshold RSA under standard assumptions. In: Boyd C (ed) Advances in Cryptology-Asiacrypt\u201901. Lecture notes in computer science, vol 2248. Springer, Berlin Heidelberg New York, pp 310\u2013330","DOI":"10.1007\/3-540-45682-1_19"},{"key":"43_CR12","doi-asserted-by":"crossref","unstructured":"Frankel Y, Gemmell P, MacKenzie P, Yung M (1997) Proactive RSA. In: Kaliski B (ed) Advances in Cryptology-Crypto\u201997. Lecture notes in computer science, vol 1294. Springer, Berlin Heidelberg New York, pp 440\u2013454","DOI":"10.1007\/BFb0052254"},{"key":"43_CR13","doi-asserted-by":"crossref","unstructured":"Gennaro R, Jarecki S, Krawczyk H, Rabin T (1996) Robust threshold DSS signatures. In: Maurer U (ed) Advances in Cryptology-Eurocrypt\u201996. Lecture notes in computer science, vol 1070. Springer, Berlin Heidelberg New York, pp 354\u2013371","DOI":"10.1007\/3-540-68339-9_31"},{"key":"43_CR14","doi-asserted-by":"crossref","unstructured":"Gennaro R, Jarecki S, Krawczyk H, Rabin T (1999) Secure distributed key generation for discrete-log based cryptosystems. In: Stern J (ed) Advances in Cryptology-Eurocrypt\u201999. Lecture notes in computer science, vol 1592. Springer, Berlin Heidelberg New York, pp 295\u2013310","DOI":"10.1007\/3-540-48910-X_21"},{"key":"43_CR15","doi-asserted-by":"crossref","unstructured":"Gennaro R, Halevi S, Rabin T (1999) Secure hash-and-sign signature without the random oracle. In: Stern J (ed) Advances in Cryptology-Eurocrypt\u201999. Lecture notes in computer science, vol 1592. Springer, Berlin Heidelberg New York, pp 123\u2013139","DOI":"10.1007\/3-540-48910-X_9"},{"key":"43_CR16","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"Goldwasser","year":"1984","unstructured":"Goldwasser S, Micali S (1984) Probabilistic encryption. J Comput Sys Sci 28:270\u2013299","journal-title":"J Comput Sys Sci"},{"key":"43_CR17","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"Goldwasser","year":"1988","unstructured":"Goldwasser S, Micali S, Rivest R (1988) A digital signature scheme secure against adaptative chosen-message attacks. SIAM J Comput 17(2):281\u2013308","journal-title":"SIAM J Comput"},{"key":"43_CR18","doi-asserted-by":"crossref","unstructured":"Herranz J, Padr\u00f3 C, S\u00e1ez G (2003) Distributed RSA signature schemes for general access structures. In: Boyd C, Mao W (eds) Proceedings of the conference on information security (ISC\u201903). Lecture notes in computer science, vol 2851. Springer, Berlin Heidelberg New York, pp 122\u2013136","DOI":"10.1007\/10958513_10"},{"key":"43_CR19","doi-asserted-by":"crossref","unstructured":"Masucci B, Stinson DR (2000) Metering schemes for general access structures. In: Cuppens F, Deswarte Y, Gollmann D, Waidner M (eds) Proceedings of ESORICS\u201900. Lecture notes in computer science, vol 1895. Springer, Berlin Heidelberg New York, pp 72\u201387","DOI":"10.1007\/10722599_5"},{"key":"43_CR20","doi-asserted-by":"crossref","unstructured":"Naor M, Pinkas B (1998) Secure and efficient metering. In: Nyberg K (ed) Advances in Cryptology-Eurocrypt\u201998. Lecture notes in computer science, vol 1403. Springer, Berlin Heidelberg New York, pp 576\u2013590","DOI":"10.1007\/BFb0054155"},{"key":"43_CR21","doi-asserted-by":"crossref","unstructured":"Naor M, Pinkas B, Reingold O (1999) Distributed pseudo-random functions and KDCs. In: Stern J (ed) Advances in Cryptology-Eurocrypt\u201999. Lecture notes in computer science, vol 1592. Springer, Berlin Heidelberg New York, pp 327\u2013346","DOI":"10.1007\/3-540-48910-X_23"},{"key":"43_CR22","doi-asserted-by":"crossref","first-page":"993","DOI":"10.1145\/359657.359659","volume":"21","author":"Needham","year":"1978","unstructured":"Needham RM, Schroeder MD (1978) Using encryption for authentication in large networks of computers. Commun ACM 21:993\u2013999","journal-title":"Commun ACM"},{"key":"43_CR23","doi-asserted-by":"crossref","unstructured":"Ogata W, Kurosawa K (2000) Provably secure metering scheme. In: Okamoto T (ed) Advances in Cryptology-Asiacrypt\u201900. Lecture notes in computer science, vol 1976. Springer, Berlin Heidelberg New York, pp 388\u2013398","DOI":"10.1007\/3-540-44448-3_29"},{"key":"43_CR24","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"Rivest","year":"1978","unstructured":"Rivest RL, Shamir A, Adleman L (1978) A method for obtaining digital signatures and public key cryptosystems. Commun ACM 21:120\u2013126","journal-title":"Commun ACM"},{"key":"43_CR25","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"Shamir","year":"1979","unstructured":"Shamir A (1979) How to share a secret. Commun ACM 22:612\u2013613","journal-title":"Commun ACM"},{"key":"43_CR26","doi-asserted-by":"crossref","unstructured":"Shoup V (2000) Practical threshold signatures. In: Preneel B (ed) Advances in Cryptology-Eurocrypt\u201900. Lecture notes in computer science, vol 1807. Springer, Berlin Heidelberg New York, pp 207\u2013220","DOI":"10.1007\/3-540-45539-6_15"},{"key":"43_CR27","first-page":"71","volume":"1","author":"Simmons","year":"1991","unstructured":"Simmons GJ, Jackson W, Martin K (1991) The geometry of secret sharing schemes. Bull ICA 1:71\u201388","journal-title":"Bull ICA"},{"key":"43_CR28","unstructured":"Stinson DR, Strobl R (2001) Provably secure distributed Schnorr signatures and a (t,n) threshold scheme for implicit certificates. In: Varadharajan V, Mu Y (eds) Proceedings of the Australasian conference on information security and privacy (ACISP\u201901). Lecture notes in computer science, vol 2119. Springer, Berlin Heidelberg New York, pp 417\u2013434"}],"container-title":["International Journal of Information Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-004-0043-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10207-004-0043-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-004-0043-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T07:01:21Z","timestamp":1559113281000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10207-004-0043-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,11]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2004,11]]}},"alternative-id":["43"],"URL":"https:\/\/doi.org\/10.1007\/s10207-004-0043-y","relation":{},"ISSN":["1615-5262","1615-5270"],"issn-type":[{"value":"1615-5262","type":"print"},{"value":"1615-5270","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,11]]}}}