{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T04:46:51Z","timestamp":1764132411952},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540431688"},{"type":"electronic","value":"9783540456643"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45664-3_26","type":"book-chapter","created":{"date-parts":[[2007,6,3]],"date-time":"2007-06-03T21:32:07Z","timestamp":1180906327000},"page":"357-374","source":"Crossref","is-referenced-by-count":14,"title":["RSA Key Generation with Verifiable Randomness"],"prefix":"10.1007","author":[{"given":"Ari","family":"Juels","sequence":"first","affiliation":[]},{"given":"Jorge","family":"Guajardo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,2,5]]},"reference":[{"key":"26_CR1","unstructured":"IEEE Std. 1363-2000. Standard Specifications for Public-Key Cryptography. The Institute of Electrical and Electronics Engineers, 2000."},{"key":"26_CR2","unstructured":"ANSI X9.31 2001. Digital Signatures Using Reversible Public Key Cryptography for the Financial Services Industry (X9.31). American National Standards Institute (ANSI), 2001."},{"key":"26_CR3","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology \u2014EUROCRYPT\u2019 98","author":"M. Bellare","year":"1998","unstructured":"M. Bellare, J.A. Garay, and T. Rabin. Fast batch verification for modular exponentiation and digital signatures. In K. Nyberg, editor, Advances in Cryptology \u2014EUROCRYPT\u2019 98. Springer-Verlag, 1998. LNCS no. 1403."},{"key":"26_CR4","unstructured":"D. Bleichenbacher. Addition chains for large sets, 1999. Unpublished manuscript."},{"key":"26_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/BFb0052253","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 97","author":"D. Boneh","year":"1997","unstructured":"D. Boneh and M. Franklin. Efficient generation of shared RSA keys. In B. Kaliski, editor, Advances in Cryptology \u2014 CRYPTO\u2019 97, pages 425\u2013439. Springer-Verlag, 1997. LNCS no. 1294."},{"key":"26_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/3-540-45539-6_31","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u2019 00","author":"F. Boudot","year":"2000","unstructured":"F. Boudot. Efficient proofs that a committed number lies in an interval. In B. Preneel, editor, Advances in Cryptology \u2014 EUROCRYPT\u2019 00, pages 431\u2013444, 2000. LNCS no. 1807."},{"issue":"3","key":"26_CR7","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/BF00196727","volume":"4","author":"J. Boyar","year":"1991","unstructured":"J. Boyar, K. Friedl, and C. Lund. Practical zero-knowledge proofs: Giving hints and using deficiencies. Journal of Cryptology, 4(3):185\u2013206, 1991.","journal-title":"Journal of Cryptology"},{"key":"26_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/3-540-48910-X_8","volume-title":"Advances in Cryptology \u2014EUROCRYPT\u2019 99","author":"J. Camenisch","year":"1999","unstructured":"J. Camenisch and M. Michels. Proving that a number is the product of two safe primes. In J. Stern, editor, Advances in Cryptology \u2014EUROCRYPT\u2019 99, pages 107\u2013122. Springer-Verlag, 1999. LNCS no. 1592."},{"key":"26_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/BFb0052252","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 97","author":"J. Camenisch","year":"1997","unstructured":"J. Camenisch and M. Stadler. Efficient group signature schemes for large groups. In B. Kaliski, editor, Advances in Cryptology \u2014 CRYPTO\u2019 97, pages 410\u2013424. Springer-Verlag, 1997. LNCS no. 1294."},{"key":"26_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/3-540-45539-6_14","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u2019 00","author":"D. Catalano","year":"2000","unstructured":"D. Catalano, R. Gennaro, and S. Halevi. Computing inverses over a shared secret modulus. In B. Preneel, editor, Advances in Cryptology \u2014 EUROCRYPT\u2019 00, pages 445\u2013452. Springer-Verlag, 2000. LNCS no. 1807."},{"key":"26_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/BFb0054154","volume-title":"Advances in Cryptology \u2014EUROCRYPT\u2019 98","author":"A. Chan","year":"1998","unstructured":"A. Chan, Y. Frankel, and Y. Tsiounis. Easy come-easy go divisible cash. In K. Nyberg, editor, Advances in Cryptology \u2014EUROCRYPT\u2019 98, pages 561\u2013575. Springer-Verlag, 1998. LNCS no. 1403. Revised version available as GTE tech. report."},{"key":"26_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/BFb0053431","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u2019 94","author":"L. Chen","year":"1994","unstructured":"L. Chen, I. Damg\u00e5rd, and T.P. Pedersen. Parallel divertibility of proofs of knowledge (extended abstract). In A. De Santis, editor, Advances in Cryptology \u2014 EUROCRYPT\u2019 94, pages 140\u2013155. Springer-Verlag, 1994. LNCS no. 950."},{"key":"26_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/3-540-48658-5_19","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 94","author":"R. Cramer","year":"1994","unstructured":"R. Cramer, I. Damg\u00e5rd, and B. Schoenmakers. Proofs of partial knowledge and simplified design of witness hiding protocols. In Y.G. Desmedt, editor, Advances in Cryptology \u2014 CRYPTO\u2019 94, pages 174\u2013187. Springer-Verlag, 1994. LNCS no. 839."},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"A. de Santis, G. di Crescenzo, G. Persiano, and M. Yung. On monotone formula closure of SZK. In 35th Annual Symposium on Foundations of Computer Science (FOCS), pages 454\u2013465. IEEE Press, 1994.","DOI":"10.1109\/SFCS.1994.365745"},{"key":"26_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/BFb0052225","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 97","author":"E. Fujisaki","year":"1997","unstructured":"E. Fujisaki and T. Okamoto. Statistical zero knowledge protocols to prove modular polynomial relations. In B. Kaliski, editor, Advances in Cryptology \u2014 CRYPTO\u2019 97, pages 16\u201330. Springer-Verlag, 1997. LNCS no. 1294."},{"key":"26_CR16","doi-asserted-by":"crossref","unstructured":"E. Fujisaki and T. Okamoto. A practical and provably secure scheme for publicly verifiable secret sharing and its applications. In N. Koblitz, editor, Advances in Cryptology \u2014 CRYPTO\u2019 98, pages 32\u201346. Springer-Verlag, 1998.","DOI":"10.1007\/BFb0054115"},{"key":"26_CR17","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1112\/S0025579300016442","volume":"23","author":"P.X. Gallagher","year":"1976","unstructured":"P.X. Gallagher. On the distribution of primes in short intervals. Mathematika, 23:4\u20139, 1976.","journal-title":"Mathematika"},{"key":"26_CR18","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T. E. Gamal","year":"1985","unstructured":"T. El Gamal. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory, 31:469\u2013472, 1985.","journal-title":"IEEE Transactions on Information Theory"},{"key":"26_CR19","doi-asserted-by":"crossref","unstructured":"R. Gennaro, D. Micciancio, and T. Rabin. An efficient non-interactive statistical zero-knowledge proof system for quasi-safe prime products. In Proceedings of the Fifth ACM Conference on Computer and Communications Security, pages 67\u201372, 1998.","DOI":"10.1145\/288090.288108"},{"key":"26_CR20","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1007\/3-540-48405-1_8","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 99","author":"N. Gilboa","year":"1999","unstructured":"N. Gilboa. Two party RSA key generation. In M. Wiener, editor, Advances in Cryptology \u2014 CRYPTO\u2019 99, pages 116\u2013129. Springer-Verlag, 1999. LNCS no. 1666."},{"key":"26_CR21","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game. In STOC\u2019 87, pages 218\u2013229. ACM Press, 1987.","DOI":"10.1145\/28395.28420"},{"key":"26_CR22","unstructured":"A. Juels. SZKrange+: Efficient and accurate range proofs. Technical report, RSA Laboratories, 1999."},{"key":"26_CR23","unstructured":"M. Liskov and B. Silverman. A statistical-limited knowledge proof for secure RSA keys, 1998. Manuscript."},{"key":"26_CR24","unstructured":"M. Malkin, T. Wu, and D. Boneh. Experimenting with shared generation of RSA keys. In 1999 Symposium on Network and Distributed System Security (SNDSS), pages 43\u201356, 1999."},{"key":"26_CR25","series-title":"Lect Notes Comput Sci","volume-title":"Selected Areas in Cryptography (SAC\u2019 98)","author":"W. Mao","year":"1998","unstructured":"W. Mao. Verifiable partial sharing of integer factors. In Selected Areas in Cryptography (SAC\u2019 98). Springer-Verlag, 1998. LNCS no. 1556."},{"key":"26_CR26","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/3-540-49649-1_18","volume-title":"Advances in Cryptology \u2014 ASIACRYPT\u2019 98","author":"W. Mao","year":"1998","unstructured":"W. Mao and C.H. Lim. Cryptanalysis in prime order subgroups of Zn. In K. Ohta and D. Pei, editors, Advances in Cryptology \u2014 ASIACRYPT\u2019 98, pages 214\u2013226. Springer-Verlag, 1998. LNCS no. 1514."},{"key":"26_CR27","doi-asserted-by":"crossref","unstructured":"A.J. Menezes, P.C. van Oorschot, and S.A. Vanstone. Handbook of Applied Cryptography. CRC Press, 1996.","DOI":"10.1201\/9781439821916"},{"key":"26_CR28","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/3-540-46766-1_9","volume-title":"Advances in Cryptology-CRYPTO\u2019 91","author":"T. Pedersen","year":"1991","unstructured":"T. Pedersen. Non-interactive and information-theoretic secure verifiable secret sharing. In J. Feigenbaum, editor, Advances in Cryptology-CRYPTO\u2019 91, pages 129\u2013140. Springer-Verlag, 1991. LNCS no. 576."},{"key":"26_CR29","series-title":"Lect Notes Comput Sci","first-page":"287","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u2019 96","author":"D. Pointcheval","year":"1996","unstructured":"D. Pointcheval and J. Stern. Security proofs for signature schemes. In U. Maurer, editor, Advances in Cryptology \u2014 EUROCRYPT\u2019 96, pages 287\u2013398. Springer-Verlag, 1996. LNCS 1070."},{"key":"26_CR30","doi-asserted-by":"crossref","unstructured":"I. Damg\u00e5rd and E. Fujisaki. An integer commitment scheme based on groups with hidden order, 2001. IACR eArchive.","DOI":"10.1007\/3-540-36178-2_8"},{"key":"26_CR31","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00196725","volume":"4","author":"C.P. Schnorr","year":"1991","unstructured":"C.P. Schnorr. Efficient signature generation by smart cards. Journal of Cryptology, 4:161\u2013174, 1991.","journal-title":"Journal of Cryptology"},{"key":"26_CR32","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"A. Shamir. How to share a secret. Communications of the ACM, 22:612\u2013613, 1979.","journal-title":"Communications of the ACM"},{"key":"26_CR33","series-title":"Lect Notes Comput Sci","first-page":"128","volume-title":"Advances in Cryptology-CRYPTO\u2019 87","author":"J. Graaf van de","year":"1987","unstructured":"J. van de Graaf and R. Peralta. A simple and secure way to show the validity of your public key. In C. Pomerance, editor, Advances in Cryptology-CRYPTO\u2019 87, pages 128\u2013134. Springer-Verlag, 1987. LNCS no. 293."},{"key":"26_CR34","unstructured":"M. Wiener. Performance comparison of public-key cryptosystems. Cryptobytes, 4(1), 1998."},{"key":"26_CR35","unstructured":"A.C. Yao. Protocols for secure computations (extended abstract). In FOCS\u2019 82, pages 160\u2013164, 1982."},{"key":"26_CR36","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/3-540-69053-0_6","volume-title":"Advances in Cryptology-EUROCRYPT\u2019 97","author":"A. Young","year":"1997","unstructured":"A. Young and M. Yung. Kleptography: Using cryptography against cryptography. In W. Fumy, editor, Advances in Cryptology-EUROCRYPT\u2019 97, pages 62\u201374. Springer-Verlag, 1997. LNCS no. 1233."}],"container-title":["Lecture Notes in Computer Science","Public Key Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45664-3_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T16:58:27Z","timestamp":1556470707000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45664-3_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540431688","9783540456643"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/3-540-45664-3_26","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}