{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:43:16Z","timestamp":1725486196497},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540430667"},{"type":"electronic","value":"9783540455370"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45537-x_7","type":"book-chapter","created":{"date-parts":[[2007,6,3]],"date-time":"2007-06-03T17:29:27Z","timestamp":1180891767000},"page":"87-102","source":"Crossref","is-referenced-by-count":3,"title":["Generalized Zig-zag Functions and Oblivious Transfer Reductions"],"prefix":"10.1007","author":[{"given":"Paolo","family":"D\u2019Arco","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Douglas","family":"Stinson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,12,20]]},"reference":[{"key":"7_CR1","series-title":"Lect Notes Comput Sci","first-page":"547","volume-title":"Advances in Cryptology: Crypto\u2019 84","author":"G.R. Blakley","year":"1984","unstructured":"G.R. Blakley, Security of Ramp Schemes, Advances in Cryptology: Crypto\u2019 84, pp. 547\u2013559, LNCS Vol. 196, pp. 242-268, 1984."},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"M. Bellare and S. Micali, Non-interactive Oblivious Transfer and Applications, Advances in Cryptology: Crypto\u2019 89, Springer-Verlag, pp. 547\u2013559, 1990.","DOI":"10.1007\/0-387-34805-0_48"},{"issue":"2","key":"7_CR3","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1145\/357360.357368","volume":"1","author":"M. Blum","year":"1993","unstructured":"M. Blum, How to Exchange (Secret) Keys, ACM Transactions of Computer Systems, Vol. 1, No. 2, pp. 175\u2013193, 1993","journal-title":"ACM Transactions of Computer Systems"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"G. Brassard, C. Crep\u00e9au, and J.-M. Roberts, Information Theoretic Reductions Among Disclosure Problems, Proceedings of 27th IEEE Symposium on Foundations of Computer Science, pp. 168\u2013173, 1986.","DOI":"10.1109\/SFCS.1986.26"},{"key":"7_CR5","first-page":"234","volume":"263","author":"G. Brassard","year":"1987","unstructured":"G. Brassard, C. Crep\u00e9au, and J.-M. Roberts, All-or-Nothing Disclosure of Secrets, Advances in Cryptology: Crypto\u2019 86, Springer-Verlag, Vol. 263, pp. 234\u2013238, 1987.","journal-title":"Advances in Cryptology: Crypto\u2019 86"},{"issue":"6","key":"7_CR6","doi-asserted-by":"publisher","first-page":"1769","DOI":"10.1109\/18.556673","volume":"42","author":"G. Brassard","year":"1996","unstructured":"G. Brassard, C. Crep\u00e9au, and M. S\u00e1ntha, Oblivious Transfer and Intersecting Codes, IEEE Transaction on Information Theory, special issue in coding and complexity, Vol. 42, No. 6, pp. 1769\u20131780, 1996.","journal-title":"IEEE Transaction on Information Theory"},{"key":"7_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"692","DOI":"10.1007\/3-540-56503-5_68","volume-title":"Proceedings of STACS","author":"C. Blundo","year":"1993","unstructured":"C. Blundo, A. De Santis, and U. Vaccaro, Efficient Sharing of Many Secrets, Proceedings of STACS, LNCS Vol. 665, pp.692\u2013703, 1993."},{"key":"7_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/3-540-45539-6_33","volume-title":"Advances in Cryptology: Proceedings of EuroCrypt 2000","author":"R. Canetti","year":"2000","unstructured":"R. Canetti, Y. Dodis, S. Halevi, E. Kushilevitz, and A. Sahai, Exposure-Resilient Functions and All-or-Nothing Transforms, Advances in Cryptology: Proceedings of EuroCrypt 2000, Springer-Verlag, LNCS vol. 1807, pp. 453\u2013469, 2000."},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0012-365X(85)90190-6","volume":"56","author":"G. Cohen","year":"1985","unstructured":"G. Cohen and A. Lempel, Linear Intersecting Codes, Discrete Mathematics, Vol. 56, pp. 35\u201343, 1985.","journal-title":"Discrete Mathematics"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"T. M. Cover and J. A. Thomas, Elements of Information Theory, John Wiley & Sons, 1991.","DOI":"10.1002\/0471200611"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"C. Crep\u00e9au, A Zero-Knowledge Poker Protocol that Achieves Con.dentiality of the Players\u2019 Strategy or How to Achieve an Electronic Poker Face, Advances in Cryptology: Proceedings of Crypto\u2019 86, Springer-Verlag, pp. 239\u2013247, 1987.","DOI":"10.1007\/3-540-47721-7_18"},{"key":"7_CR12","first-page":"350","volume":"293","author":"C. Crep\u00e9au","year":"1988","unstructured":"C. Crep\u00e9au, Equivalence between to flavors of oblivious transfers, Advances in Cryptology: Proceedings of Crypto\u2019 87, Springer-Verlag, vol. 293, pp. 350\u2013354, 1988.","journal-title":"Advances in Cryptology: Proceedings of Crypto\u2019 87"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"C. Crep\u00e9au and J. Kilian, Achieving Oblivious Transfer Using Weakened Security Assumptions, Proceedings of 29th IEEE Symposium on Foundations of Computer Science, pp. 42\u201352, 1988.","DOI":"10.1109\/SFCS.1988.21920"},{"key":"7_CR14","first-page":"42","volume":"1592","author":"Y. Dodis","year":"1999","unstructured":"Y. Dodis and S. Micali, Lower Bounds for Oblivious Transfer Reduction, Advances in Cryptology: Proceedings of Eurocrypt\u2019 99, vol. 1592, pp. 42\u201354, Springer Verlag, 1999.","journal-title":"Advances in Cryptology: Proceedings of Eurocrypt\u2019 99"},{"key":"7_CR15","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/978-1-4757-0602-4_19","volume-title":"Advances in Cryptology: Proceedings of Crypto\u2019 83","author":"S. Even","year":"1983","unstructured":"S. Even, O. Goldreich, and A. Lempel, A Randomized Protocol for Signing Contracts, Advances in Cryptology: Proceedings of Crypto\u2019 83, Plenum Press, New York, pp. 205\u2013210, 1983."},{"issue":"3","key":"7_CR16","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s001459900011","volume":"9","author":"M. Fisher","year":"1996","unstructured":"M. Fisher, S. Micali, and C. Racko., A Secure Protocol for the Oblivious Transfer, Journal of Cryptology, vol. 9, No. 3, pp. 191\u2013195, 1996.","journal-title":"Journal of Cryptology"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"M. Franklin and M. Yung, Communication Complexity of Secure Computation, Proceedings of the 24th Annual Symposium on Theory of Computing, pp. 699\u2013710, 1992.","DOI":"10.1145\/129712.129780"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, and A. Wigderson, How to play ANY mental game or: A Completeness Theorem for Protocols with Honest Majority, Proceedings of 19th Annual Symposium on Theory of Computing, pp. 20\u201331, 1987.","DOI":"10.1145\/28395.28420"},{"key":"7_CR19","first-page":"51","volume":"14","author":"W.-A. Jackson","year":"1996","unstructured":"W.-A. Jackson and K. Martin, A Combinatorial Interpretation of Ramp Schemes, Australasian Journal of Combinatorics, vol. 14, pp. 51\u201360, 1996.","journal-title":"Australasian Journal of Combinatorics"},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"A. Hedayat, N.J.A. Sloane, and J. Stufken, Orthogonal Arrays: Theory and Applications, Springer Verlag, 1999.","DOI":"10.1007\/978-1-4612-1478-6"},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"J. Kilian, Founding Cryptography on Oblivious Transfer, Proceedings of 20th Annual Symposium on Theory of Computing, pp. 20\u201331, 1988.","DOI":"10.1145\/62212.62215"},{"key":"7_CR22","unstructured":"M. Naor and B. Pinkas, Computationally Secure Oblivious Transfer, available at http:\/\/www.wisdom.weizmann.ac.il\/naor\/onpub.html"},{"key":"7_CR23","unstructured":"M. Naor and B. Pinkas, Efficient Oblivious Transfer Protocols, available at http:\/\/www.wisdom.weizmann.ac.il\/naor\/onpub.html"},{"key":"7_CR24","unstructured":"M. Rabin, How to Exchange Secrets by Oblivious Transfer, Technical Memo TR-81, Aiken Computation Laboratory, Harvard University, 1981."},{"key":"7_CR25","unstructured":"D.R. Stinson, Some Results on Nonlinear Zig-zag Functions, The Journal of Combinatorial Mathematics and Combinatorial Computing, No. 29, pp. 127\u2013138, 1999."},{"key":"7_CR26","first-page":"105","volume":"92","author":"D.R. Stinson","year":"1993","unstructured":"D.R. Stinson, Resilient Functions and Large Set of Orthogonal Arrays, Congressus Numerantium, Vol. 92, 105\u2013110, 1993.","journal-title":"Congressus Numerantium"},{"key":"7_CR27","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/1008908.1008920","volume":"15","author":"S. Wiesner","year":"1983","unstructured":"S. Wiesner, Conjugate Coding, SIGACT News, Vol. 15, pp. 78\u201388, 1983.","journal-title":"SIGACT News"}],"container-title":["Lecture Notes in Computer Science","Selected Areas in Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45537-X_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T12:58:20Z","timestamp":1556456300000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45537-X_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540430667","9783540455370"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/3-540-45537-x_7","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}