{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T11:07:16Z","timestamp":1777892836378,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540180470","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-47721-7_19","type":"book-chapter","created":{"date-parts":[[2007,4,5]],"date-time":"2007-04-05T06:32:57Z","timestamp":1175754777000},"page":"251-260","source":"Crossref","is-referenced-by-count":136,"title":["Secret Sharing Homomorphisms: Keeping Shares of a Secret Secret (Extended Abstract)"],"prefix":"10.1007","author":[{"given":"Josh Cohen","family":"Benaloh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","unstructured":"Adleman, L. \u201cSubexponential Algorithm for The Discrete Logarithm Problem.\u201d Proc. 20thIEEE Symp. on Foundations of Computer Science, San Juan, PR (Oct. 1979), 55\u201360."},{"key":"19_CR2","volume-title":"A Modular Approach to Key Safeguarding","author":"C. Asmuth","year":"1980","unstructured":"Asmuth, C. and Bloom, J. \u201cA Modular Approach to Key Safeguarding.\u201d Texas A&M University, Departement of Mathematics, College Station, TX (1980)."},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Benaloh, J. and Yung, M. \u201cDistributing the Power of a Government to Enhance the Privacy of Voters.\u201d Proc. 5thACM Symp. on Principles of Distributed Computing, Calgary, AB (Aug. 1986).","DOI":"10.1145\/10590.10595"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Blakley, G. \u201cSafeguarding Cryptographic Keys.\u201d Proc. AFIPS 1979 National Computer Conference, New York, NY (June 1979), 313\u2013317.","DOI":"10.1109\/MARK.1979.8817296"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Blakley, G. and Meadows, C. \u201cA Database Encryption Scheme Which Allows the Computation of Statistics Using Encrypted Data.\u201d Proc. IEEE Symposium on Computer Security and Privacy, Oakland, CA (Apr. 1985).","DOI":"10.1109\/SP.1985.10024"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Chor, B., Goldwasser, S., Micali, S., and Awerbuch, B. \u201cVerifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults.\u201d Proc. 26thIEEE Symp. on Foundations of Computer Science, Portland, OR (Oct. 1985), 383\u2013395.","DOI":"10.1109\/SFCS.1985.64"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Cohen, J. and Fischer, M. \u201cA Robust and Verifiable Cryptographically Secure Election Scheme.\u201d Proc. 26thIEEE Symp. on Foundations of Computer Science, Portland, OR (Oct. 1985), 372\u2013382.","DOI":"10.1109\/SFCS.1985.2"},{"key":"19_CR8","volume-title":"Improving Privacy in Cryptographic Elections","author":"J. Cohen","year":"1986","unstructured":"Cohen, J. \u201cImproving Privacy in Cryptographic Elections.\u201d TR-454, Yale University, Departement of Computer Science, New Haven, CT (Feb. 1986)."},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01840433","volume":"1","author":"D. Coppersmith","year":"1986","unstructured":"Coppersmith, D., Odlyzko, A., and Schroeppel, R. \u201cDiscrete Logarithms in GF(p).\u201d Algorithmica, 1 (1986), 1\u201315.","journal-title":"Algorithmica"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"DeMillo, R., Lynch, N., and Merritt, M. \u201cCryptographic Protocols.\u201d Proc. 14thACM Symp. on Theory of Computing, San Francisco, CA (May 1982), 383\u2013400.","DOI":"10.1145\/800070.802214"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Feigenbaum, J. \u201cEncrypting Problem Instances or Can You Take Advantage of Someone Without Having to Trust Him\u201d, Proc. Crypto\u2019 85, Santa Barbara, CA (Aug. 1985), 477\u2013488. Published as Advances in Cryptology, ed. by H. Williams in Lecture Notes in Computer Science, vol. 218, ed. by G. Goos and J. Hartmanis. Springer-Verlag, New York (1985).","DOI":"10.1007\/3-540-39799-X_38"},{"key":"19_CR12","unstructured":"Fischer, M., Micali, S., and Rackoff, C. \u201cA Secure Protocol for the Oblivious Transfer.\u201d Presented at Eurocrypt84, Paris, France (Apr. 1984). (Not in proceedings.)"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S., and Rackoff C. \u201cThe Knowledge of Complexity of Interactive Proof-Systems.\u201d Proc. 17thACM Symp. on Theory of Computing, Providence, RI (May 1985), 291\u2013304.","DOI":"10.1145\/22145.22178"},{"key":"19_CR14","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"Goldwasser, S. and Micali, S. \u201cProbabilistic Encryption.\u201d J. Comput. System Sci. 28, (1984), 270\u2013299.","journal-title":"J. Comput. System Sci."},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"Kothari, S. \u201cGeneralized Linear Threshold Scheme.\u201d Proc. Crypto\u2019 84, Santa Barbara, CA (Aug. 1984), 231\u2013241. Published as Advances in Cryptology, ed. by G. Blakely and D. Chaum in Lecture Notes in Computer Science, vol. 196, ed. by G. Goos and J. Hartmanis. Springer-Verlag, New York (1985).","DOI":"10.1007\/3-540-39568-7_19"},{"issue":"1","key":"19_CR16","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1109\/TIT.1978.1055817","volume":"24","author":"S. Pohlig","year":"1978","unstructured":"Pohlig, S. and Hellman, M. \u201cAn Improved Algorithm for Computing Logarithms Over GF(2) and Its Cryptographic Significance.\u201d IEEE Trans. on Information Theory 24,1 (Jan. 1978), 106\u2013110.","journal-title":"IEEE Trans. on Information Theory"},{"key":"19_CR17","first-page":"169","volume-title":"Foundations of Secure Computation","author":"R. Rivest","year":"1978","unstructured":"Rivest, R., Adleman, L., and Dertouzos, M. \u201cOn Data Banks and Privacy Homomorphisms.\u201d Foundations of Secure Computation, ed. by R. A. DeMillo, et al. Academic Press, New York (1978), 169\u2013179."},{"key":"19_CR18","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"11","author":"A. Shamir","year":"1979","unstructured":"Shamir, A. \u201cHow to Share a Secret.\u201d Comm. ACM 22, 11 (Nov. 1979), 612\u2013613.","journal-title":"Comm. ACM 22"},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"Yao, A. \u201cProtocols for Secure Computations.\u201d Proc. 23rdIEEE Symp. on Foundations of Computer Science, Chicago, IL (Nov. 1982), 160\u2013164.","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO\u2019 86"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-47721-7_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:14:13Z","timestamp":1605629653000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-47721-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540180470"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-47721-7_19","relation":{},"subject":[]}}