{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T11:24:22Z","timestamp":1768562662866,"version":"3.49.0"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1994,12,1]],"date-time":"1994-12-01T00:00:00Z","timestamp":786240000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Cryptology"],"published-print":{"date-parts":[[1994,12]]},"DOI":"10.1007\/bf00195209","type":"journal-article","created":{"date-parts":[[2004,8,27]],"date-time":"2004-08-27T20:49:23Z","timestamp":1093639763000},"page":"53-60","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["On the structure of the privacy hierarchy"],"prefix":"10.1007","volume":"7","author":[{"given":"Benny","family":"Chor","sequence":"first","affiliation":[]},{"given":"Mih\u00e1ly","family":"Ger\u00e9b-Graus","sequence":"additional","affiliation":[]},{"given":"Eyal","family":"Kushilevitz","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF00195209_CR1","unstructured":"Beaver, D., Perfect Privacy for Two Party Protocols, Technical Report TR-11-89, Harvard University, 1989."},{"key":"BF00195209_CR2","series-title":"Lecture Notes in Computer Science, Vol. 263","first-page":"251","volume-title":"Advances in Cryptography\u2014Crypto 86 (Proceedings)","author":"J. D. Benaloh (Cohen)","year":"1987","unstructured":"Benaloh (Cohen), J. D., Secret Sharing Homomorphisms: Keeping Shares of a Secret Secret, Advances in Cryptography\u2014Crypto 86 (Proceedings), A. M. Odlyzko (ed.), Lecture Notes in Computer Science, Vol. 263, Springer-Verlag, Berlin, 1987, pp. 251\u2013260."},{"key":"BF00195209_CR3","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., S. Goldwasser, and A. Wigderson, Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation Proc. 20th STOC, 1988, pp. 1\u201310.","DOI":"10.1145\/62212.62213"},{"key":"BF00195209_CR4","doi-asserted-by":"crossref","unstructured":"Blakley, G. R., Safeguarding Cryptographic Keys, Proc. NCC AFIPS, 1979, pp. 313\u2013317.","DOI":"10.1109\/MARK.1979.8817296"},{"key":"BF00195209_CR5","doi-asserted-by":"crossref","unstructured":"Chaum, D., C. Crepeau, and I. Damgard, Multiparity Unconditionally Secure Protocols, Proc. 20th STOC, 1988, pp. 11\u201319.","DOI":"10.1145\/62212.62214"},{"key":"BF00195209_CR6","doi-asserted-by":"crossref","unstructured":"Chor, B., M. Ger\u00e9b-Graus, and E. Kushilevitz, Private Computations Over the Integers, Proc. 31th IEEE Conf. on the Foundations of Computer Science, October 1990, pp. 335\u2013344.","DOI":"10.1109\/FSCS.1990.89552"},{"issue":"No. 1","key":"BF00195209_CR7","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1137\/0404004","volume":"Vol. 4","author":"B. Chor","year":"1991","unstructured":"Chor, B., and E. Kushilevitz, A Zero-One Law for Boolean Privacy, SIAM J. Discrete Math., Vol. 4, No. 1, 1991, pp. 36\u201347. Early version in Proc. 21th STOC, 1989, pp. 62\u201372.","journal-title":"SIAM J. Discrete Math."},{"key":"BF00195209_CR8","unstructured":"Chor, B., and N. Shani, Privacy of Dense Symmetric Functions, Proc. 2nd Positano Workshop on Sequences, 1991."},{"issue":"No. 2","key":"BF00195209_CR9","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1137\/0405021","volume":"Vol. 5","author":"E. Kushilevitz","year":"1992","unstructured":"Kushilevitz, E., Privacy and Communication Complexity, SIAM J. Discrete Math., Vol. 5, No. 2, 1992, pp. 273\u2013284. Early version in Proc. 30th IEEE Conf. on the Foundations of Computer Science, 1989, pp. 416\u2013421.","journal-title":"SIAM J. Discrete Math."},{"key":"BF00195209_CR10","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"Vol. 22","author":"A. Shamir","year":"1979","unstructured":"Shamir, A., How To Share a Secret, Comm. ACM, Vol. 22, 1979, pp. 612\u2013613.","journal-title":"Comm. ACM"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00195209.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00195209\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00195209","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00195209.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,18]],"date-time":"2024-12-18T11:59:56Z","timestamp":1734523196000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00195209"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,12]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,12]]}},"alternative-id":["BF00195209"],"URL":"https:\/\/doi.org\/10.1007\/bf00195209","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,12]]},"assertion":[{"value":"21 July 1992","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 November 1992","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}