{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T13:00:35Z","timestamp":1772283635904,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540003243","type":"print"},{"value":"9783540362883","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36288-6_7","type":"book-chapter","created":{"date-parts":[[2007,6,3]],"date-time":"2007-06-03T16:45:01Z","timestamp":1180889101000},"page":"85-99","source":"Crossref","is-referenced-by-count":79,"title":["Randomness Re-use in Multi-recipient Encryption Schemeas"],"prefix":"10.1007","author":[{"given":"Mihir","family":"Bellare","sequence":"first","affiliation":[]},{"given":"Alexandra","family":"Boldyreva","sequence":"additional","affiliation":[]},{"given":"Jessica","family":"Staddon","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,12,18]]},"reference":[{"key":"7_CR1","unstructured":"O. Baudron, D. Pointcheval and J. Stern, \u201cExtended notions of security for multicast public key cryptosystems.\u201d ICALP 2000 86, 87, 91, 92, 93"},{"key":"7_CR2","series-title":"Lect Notes Comput Sci","volume-title":"CT-RSA 01","author":"M. Abdalla","year":"2001","unstructured":"M. Abdalla, M. Bellare, and P. Rogaway, \u201cThe Oracle Diffie-Hellman Assumptions and an Analysis of DHIES,\u201d CT-RSA 01, Lecture Notes in Computer Science Vol. 2020, D. Naccache ed, Springer-Verlag, 2001. 88, 96"},{"key":"7_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-44598-6","volume-title":"Advances in Cryptology\u2013Eurocrypt\u2019 00","author":"M. Bellare","year":"2000","unstructured":"M. Bellare, A. Boldyreva, and S. Micali, \u201cPublic-key Encryption in a Multi-User Setting: Security Proofs and Improvements,\u201d Advances in Cryptology\u2013Eurocrypt\u2019 00, LNCS Vol. 1807, B. Preneel ed., Springer-Verlag, 2000 86, 87, 88, 89, 91, 92, 93, 95"},{"key":"7_CR4","unstructured":"M. Bellare, A. Boldyreva, and J. Staddon \u201cRandomness Re-Use in Multi-Recipient Encryption Schemes\u201d, Full version of this paper. Available at http:\/\/ www-cse.ucsd.edu\/users\/aboldyre 89, 90, 94, 95, 96, 97"},{"key":"7_CR5","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology\u2013Crypto\u2019 98","author":"M. Bellare","year":"1998","unstructured":"M. Bellare, A. Desai, D. Pointcheval and P. Rogaway, \u201cRelations among notions of security for public-key encryption schemes,\u201d Advances in Cryptology\u2013Crypto\u2019 98, LNCS Vol. 1462, H. Krawczyk ed., Springer-Verlag, 1998."},{"key":"7_CR6","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology\u2013Crypto\u2019 92","author":"M. Bellare","year":"1992","unstructured":"M. Bellare and O. Goldreich, \u201cOn defining proofs of knowledge,\u201d Advances in Cryptology\u2013Crypto\u2019 92, LNCS Vol. 740, E. Brickell ed., Springer-Verlag, 1992. 94"},{"key":"7_CR7","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology\u2013Eurocrypt\u2019 91","author":"S. Berkovits","year":"1991","unstructured":"S. Berkovits, \u201cHow to Broadcast a Secret\u201d, Advances in Cryptology\u2013Eurocrypt\u2019 91, LNCS Vol. 547, D. Davies ed., Springer-Verlag, 1991."},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"M. Blum and S. Micali, \u201cHow to generate cryptographically strong sequences of pseudo-random bits,\u201d SIAM J. on Computing Vol. 13, No. 4, November 1984.","DOI":"10.1137\/0213053"},{"key":"7_CR9","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology\u2013Crypto\u2019 01","author":"D. Boneh","year":"2001","unstructured":"D. Boneh. \u201cSimpli.ed OAEP for the RSA and Rabin Functions,\u201d Advances in Cryptology\u2013Crypto\u2019 01, LNCS Vol. 2139, J. Kilian ed., Springer-Verlag, 2001."},{"key":"7_CR10","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology\u2013Crypto\u2019 01","author":"D. Boneh","year":"2001","unstructured":"D. Boneh and M. Franklin. \u201cIdentity-based encryption from the Weil Pairing,\u201d Advances in Cryptology\u2013Crypto\u2019 01, LNCS Vol. 2139, J. Kilian ed., Springer-Verlag, 2001. 89, 97"},{"key":"7_CR11","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology\u2013Eurocrypt\u2019 00","author":"J. Camenisch","year":"2000","unstructured":"J. Camenisch and M. Michels, \u201cConfirmer signature schemes secure against adaptive adversaries,\u201d Advances in Cryptology\u2013Eurocrypt\u2019 00, LNCS Vol. 1807, B. Preneel ed., Springer-Verlag, 2000."},{"key":"7_CR12","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology\u2013Crypto\u2019 97","author":"R. Canetti","year":"1997","unstructured":"R. Canetti,, \u201cTowards Realizing Random Oracles: Hash Functions that Hide All Partial Information,\u201d,Advances in Cryptology\u2013Crypto\u2019 97, LNCS Vol. 1294, B. Kaliski ed., Springer-Verlag, 1997 95"},{"key":"7_CR13","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology\u2013Crypto\u2019 98","author":"R. Cramer","year":"1998","unstructured":"R. Cramer and V. Shoup, \u201cA practical public key cryptosystem provably secure against adaptive chosen ciphertext attack,\u201d Advances in Cryptology\u2013Crypto\u2019 98, LNCS Vol. 1462, H. Krawczyk ed., Springer-Verlag, 1998. 86, 88, 95, 96"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"T. ElGamal, \u201cA public key cryptosystem and signature scheme based on discrete logarithms,\u201d IEEE Transactions on Information Theory, vol 31, 1985.","DOI":"10.1007\/3-540-39568-7_2"},{"key":"7_CR15","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology\u2013Crypto\u2019 93","author":"A. Fiat","year":"1993","unstructured":"A. Fiat and M. Naor, \u201cBroadcast Encryption\u201d, Advances in Cryptology\u2013Crypto\u2019 93, LNCS Vol. 773, D. Stinson ed., Springer-Verlag, 1993."},{"key":"7_CR16","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology\u2013Crypto\u2019 01","author":"E. Fujisaki","year":"2001","unstructured":"E. Fujisaki, T. Okamoto, D. Pointcheval and J. Stern, \u201cRSA-OAEP is Secure under the RSA Assumption,\u201d Advances in Cryptology\u2013Crypto\u2019 01, LNCS Vol. 2139, J. Kilian ed., Springer-Verlag, 2001. 91"},{"key":"7_CR17","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"S. Goldwasser and S. Micali, \u201cProbabilistic encryption,\u201d Journal of Computer and System Science, Vol. 28, 1984, pp. 270\u2013299.","journal-title":"Journal of Computer and System Science"},{"issue":"4","key":"7_CR18","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1145\/6490.6503","volume":"33","author":"O. Goldreich","year":"1986","unstructured":"O. Goldreich, S. Goldwasser and S. Micali, \u201cHow to construct random functions,\u201dJournal of the ACM, Vol. 33, No. 4, 210\u2013217, (1986).","journal-title":"Journal of the ACM"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"J. H\u00c5stad, \u201cSolving simultaneous modular equations of low degree,\u201d SIAM J. on Computing Vol. 17, No. 2, April 1988. 87","DOI":"10.1137\/0217019"},{"issue":"4","key":"7_CR20","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J. H\u00c5stad","year":"1999","unstructured":"J. H\u00c5stad, R. Impagliazzo, L. Levin, and M. Luby, \u201cA pseudorandom generation from any one-way function,\u201d SIAM Journal on Computing, Vol. 28, No. 4, 1364\u20131396, 1999.","journal-title":"SIAM Journal on Computing"},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo and M. Luby, \u201cOne-way functions are essential for complexity based cryptography,\u201d Proceedings of the 30th Symposium on Foundations of Computer Science, IEEE, 1989","DOI":"10.1109\/SFCS.1989.63483"},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"K. Kurosawa, \u201cMulti-Recipient Public-Key Encryption with Shortened Ciphertext,\u201d Proceedings of the Fifth International workshop on practice and theory in Public Key Cryptography (PKC\u201902). 86, 87, 88, 89, 92, 93, 95, 96","DOI":"10.1007\/3-540-45664-3_4"},{"key":"7_CR23","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology\u2013Crypto\u2019 86","author":"S. Micali","year":"1986","unstructured":"S. Micali, C. Rackoff and R. H. Sloan, \u201cThe notion of security for probabilistic cryptosystems,\u201d Advances in Cryptology\u2013Crypto\u2019 86, LNCS Vol. 263, A. Odlyzko ed., Springer-Verlag, 1986."},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"M. Naor and O. Reingold, \u201cNumber-theoretic constructions of efficient pseudo-random functions,\u201d Proceedings of the 38th Symposium on Foundations of Computer Science, IEEE, 1997. 88, 95","DOI":"10.1109\/SFCS.1997.646134"},{"key":"7_CR25","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology\u2013Crypto\u2019 91","author":"C. Rackoff","year":"1991","unstructured":"C. Rackoff and D. Simon, \u201cNon-interactive zero-knowledge proof of knowledge and chosen-ciphertext attack,\u201d Advances in Cryptology\u2013Crypto\u2019 91, LNCS Vol. 576, J. Feigenbaum ed., Springer-Verlag, 1991."},{"key":"7_CR26","unstructured":"V. Shoup, \u201cOn formal models for secure key exchange, \u201d Theory of Cryptography Library Record 99-12, http:\/\/philby.ucsd.edu\/cryptolib\/ . 88"},{"key":"7_CR27","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology\u2013Eurocrypt\u2019 96","author":"M. Stadler","year":"1996","unstructured":"M. Stadler, \u201cPublicly verifiable secret sharing,\u201d Advances in Cryptology\u2013Eurocrypt\u2019 96, LNCS Vol. 1070, U. Maurer ed., Springer-Verlag, 1996. 88"},{"key":"7_CR28","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of the First International workshop on practice and theory in Public Key Cryptography (PKC\u201998)","author":"Y. Tsiounis","year":"1998","unstructured":"Y. Tsiounis and M. Yung, \u201cOn the security of El Gamal based encryption,\u201d Proceedings of the First International workshop on practice and theory in Public Key Cryptography (PKC\u201998), Lecture Notes in Computer Science Vol. 1431, H. Imai and Y. Zheng eds., Springer-Verlag, 1998. 95"},{"key":"7_CR29","doi-asserted-by":"crossref","unstructured":"D. Wallner, E. Harder and R. Agee, \u201cKey Management for Multicast: Issues and Architectures,\u201d Internet Request for Comments, 2627 (June 1999). Available http:\/\/ftp.ietf.org\/rfc\/rfc2627.txt .","DOI":"10.17487\/rfc2627"},{"key":"7_CR30","doi-asserted-by":"crossref","unstructured":"A. C. Yao. \u201cTheory and application of trapdoor functions,\u201d Proceedings of the 23rd Symposium on Foundations of Computer Science, IEEE, 1982","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Lecture Notes in Computer Science","Public Key Cryptography \u2014 PKC 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36288-6_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T12:56:26Z","timestamp":1556456186000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36288-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,12,18]]},"ISBN":["9783540003243","9783540362883"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/3-540-36288-6_7","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002,12,18]]}}}