{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,15]],"date-time":"2025-07-15T03:44:17Z","timestamp":1752551057823},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540191025"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-39118-5_12","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T15:51:38Z","timestamp":1279036298000},"page":"117-125","source":"Crossref","is-referenced-by-count":16,"title":["On Privacy Homomorphisms (Extended Abstract)"],"prefix":"10.1007","author":[{"given":"Ernest F.","family":"Brickell","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yacov","family":"Yacobi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"9","key":"12_CR1","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1145\/30401.30404","volume":"30","author":"N. Ahituv","year":"1987","unstructured":"N. Ahituv, Y. Lapid, S. Neumann, \u201cProcessing Encrypted Data\u201d, CACM, Sept. 1987, Vo. 30, No. 9, pp. 777\u2013780.","journal-title":"CACM"},{"key":"12_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1007\/3-540-39568-7_27","volume-title":"Advances in Cryptofogy, Proc. Crypto 84","author":"E. F. Brickell","year":"1985","unstructured":"E. F. Brickell. \u201cBreaking Iterated Knapsacks\u201d, Advances in Cryptofogy, Proc. Crypto 84, Santa Barbara, August 19\u201322, 1984, Lecture Notes in Computer Science, vol. 196, Springer-Verlag, Berlin, 1985, pp. 342\u2013358."},{"key":"12_CR3","unstructured":"E. F. Brickell. P. J. Lee. Y. Yacobi. \u201cSecure Audio Teleconference\u201d, to appear in Advances in Cryptofogy, Proc. Crypro 87, Springer-Verlag, New York."},{"key":"12_CR4","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/978-1-4684-4730-9_1","volume-title":"Advances in Cryprology, Proc. Crypto 83","author":"J. C. Lagarias","year":"1984","unstructured":"J. C. Lagarias, \u201cKnapsack Public Key Cryptosystems and Diophantine Approximation\u201d (Extended Abstract), Advances in Cryprology, Proc. Crypto 83, Plenum Publ. Co., New York, 1984, pp.3\u201324."},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"A. K. Lustra","year":"1982","unstructured":"A. K. Lustra, H. W. Lenstra, Jr., and L. Lovasz, \u201cFactoring Polynomials with Rational Coefficients\u201d, Mathematische Annaten 261, pp. 515\u2013534, 1982.","journal-title":"Mathematische Annaten"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1109\/TIT.1978.1055817","volume":"IT-24","author":"S. C. Pohlig","year":"1978","unstructured":"Stephen C. Pohlig and Martin E. Hellman, \u201cAn Improved algorithm for computing Logarithms over GF(p) and its cryptographic signiticance\u201d, IEEE Trans. on Inf. Th. Vol. IT-24, No. 1 Jan. 1978. pp. 106\u2013110.","journal-title":"IEEE Trans. on Inf. Th."},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1017\/S0305004100049252","volume":"76","author":"J. M. Pollard","year":"1974","unstructured":"J. M. Pollard, \u201cTheorems on factorization and primality testing\u201d, Proc. Cambridge Philos. Soc. vol. 76 (1974). pp. 521\u2013528.","journal-title":"Proc. Cambridge Philos. Soc."},{"key":"12_CR8","unstructured":"Ronald L. Rivest, Len Adleman and Michael L. Dertouzos, \u201cOn data banks and privacy homomorphisms\u201d, in Foundation of Secure Computations, Academic Press 1978."},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1145\/359460.359473","volume":"21","author":"R. L. Rivest","year":"1978","unstructured":"R. L. Rivest, A. Shamir and L. Adleman, \u201cA Method for Obtaining Digital Signatures and Public Key Cryptosystems\u201d, Comun. ACM, vol. 21, pp. 294\u2013299, April 1978.","journal-title":"Comun. ACM"},{"issue":"5","key":"12_CR10","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1109\/TIT.1984.1056964","volume":"IT-30","author":"A. Shamir","year":"1984","unstructured":"A. Shamir, \u201cA Polynomial Time Algorithm for Breaking the Basic Merkle-Hellman Cryptosystem\u201d, IEEE Trans. Inform. Theory, vol. IT-30, No. 5, September 1984, pp. 699\u2013704.","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT \u201987"],"original-title":[],"language":"en","deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:40:44Z","timestamp":1550324444000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-39118-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540191025"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-39118-5_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}