{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:24:02Z","timestamp":1725488642189},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540564133"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-47555-9_19","type":"book-chapter","created":{"date-parts":[[2007,8,8]],"date-time":"2007-08-08T19:23:49Z","timestamp":1186601029000},"page":"208-220","source":"Crossref","is-referenced-by-count":5,"title":["Batch Diffie-Hellman Key Agreement Systems and their Application to Portable Communications"],"prefix":"10.1007","author":[{"given":"Michael J.","family":"Beller","sequence":"first","affiliation":[]},{"given":"Yacov","family":"Yacobi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","unstructured":"A.V. Aho, J.E. Hopcroft, and J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison Wesley, 1974."},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Ben-David, S., Chor, B., Goldreich, O., Luby, M., On the Theory of Average Case Complexity, Proc. STOC 1989, pp. 204\u2013216.","DOI":"10.1145\/73007.73027"},{"key":"19_CR3","unstructured":"M. J. Beller, L. F. Chang, Y. Yacobi, Privacy and Authentication on a Portable Communications System, IEEE Globecom\u2019 91 Conference Proceedings, Phoenix, December 1991."},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"D. C. Cox, Portable Digital Radio Communications-An Approach to Tether-less Access, IEEE Communications Magazine, Vol. 27, No. 7, July 1989.","DOI":"10.1109\/35.31454"},{"key":"19_CR5","first-page":"664","volume":"IT-22","author":"W. Diffie","year":"1976","unstructured":"W. Diffie and M.E. Hellman, New directions in cryptography, IEEE Trans. on Inform. Theory, vol. IT-22, pp. 664\u2013654, Nov. 1976.","journal-title":"IEEE Trans. on Inform. Theory"},{"key":"19_CR6","series-title":"Lect Notes Comput Sci","first-page":"230","volume-title":"Advances in Cryptology: Proceedings of Eurocrypt\u2019 90","author":"S.R. Dusse","year":"1990","unstructured":"S.R. Dusse and B.S. Kaliski, A Cryptographic Library for the Motorola DSP56000, Advances in Cryptology: Proceedings of Eurocrypt\u2019 90, I.B. Damgard (Ed.), LNCS 473, Springer Verlag, May 1990, pp. 230\u2013243."},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"A. Fiat: Batch RSA, Proc. Crypto\u201989, pp 175\u2013185.","DOI":"10.1007\/0-387-34805-0_17"},{"key":"19_CR8","unstructured":"A.K. Lenstra, Private communication."},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"K.S. McCurley, A key distribution system equivalent to factoring, J. Cryptology, vol. 1, no. 2, 1988.","DOI":"10.1007\/BF02351718"},{"key":"19_CR10","unstructured":"U.M. Maurer and Y. Yacobi Non-interactive Public Key Cryptography Proc. Eurocrypt\u201991."},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"519","DOI":"10.2307\/2007970","volume":"44","author":"P.L. Montgomery","year":"1985","unstructured":"P.L. Montgomery, Modular Multiplication Without Trial Division, Math of Computation, Vol. 44, 1985, pp. 519\u2013521.","journal-title":"Math of Computation"},{"key":"19_CR12","doi-asserted-by":"publisher","first-page":"918","DOI":"10.2307\/2006496","volume":"32","author":"J.M. Pollard","year":"1978","unstructured":"J.M. Pollard, Monte Carlo Methods for Index Computation (mod P), Math, Comp. 32 (1978), 918\u2013924.","journal-title":"Math, Comp."},{"key":"19_CR13","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R.L. Rivest","year":"1978","unstructured":"R.L. Rivest, A. Shamir and L. Adleman, A method for obtaining digital signatures and public-key cryptosystems, Communications of the ACM, vol. 21, pp. 120\u2013126, 1978.","journal-title":"Communications of the ACM"},{"key":"19_CR14","unstructured":"Z. Shmuely, Composite Diffie-Hellman public-key generating systems are hard to break, TR 356, CS Dept., Technion, Feb. 1985."},{"key":"19_CR15","unstructured":"Y. Yacobi, A key distribution \u201cparadox\u201d, Proc. CRYPTO\u201990 Santa Barbara, CA, Aug. 11\u201315, 1990."},{"key":"19_CR16","unstructured":"Y. Yacobi, Discrete-Log With Compressible Exponents Proc. CRYPTO\u201990, Santa Barbara, CA, Aug. 11\u201315, 1990."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT\u2019 92"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-47555-9_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:13:55Z","timestamp":1605629635000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-47555-9_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540564133"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-47555-9_19","relation":{},"subject":[]}}