{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T03:00:03Z","timestamp":1729652403735,"version":"3.28.0"},"reference-count":26,"publisher":"IEEE Computer. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/sfcs.2003.1238216","type":"proceedings-article","created":{"date-parts":[[2004,3,1]],"date-time":"2004-03-01T21:26:50Z","timestamp":1078176410000},"page":"428-501","source":"Crossref","is-referenced-by-count":2,"title":["Separating the power of monotone span programs over different fields"],"prefix":"10.1109","author":[{"given":"A.","family":"Beimel","sequence":"first","affiliation":[]},{"given":"E.","family":"Weinreb","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579205"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/SCT.1993.336536"},{"key":"18","first-page":"330","article-title":"Las vegas is better than determinism in vlsi and distributed computing","author":"mehlhorn","year":"1982","journal-title":"Proc of the 14th STOC"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04650-0"},{"journal-title":"Communication Complexity","year":"1997","author":"kushilevitz","key":"16"},{"key":"13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0163-9","author":"godsil","year":"2001","journal-title":"Algebraic Graph Theory Vol 207 of Graduate Texts in Mathematics"},{"key":"14","first-page":"99","article-title":"Secret sharing schemes realizing general access structure","author":"ito","year":"1987","journal-title":"Proc IEEE Global Telecomm Conf GLOBECOM"},{"key":"11","article-title":"On relations between counting communication complexity classes","author":"damm","year":"2003","journal-title":"J of Computer and System Sciences"},{"key":"12","first-page":"429","article-title":"A characterization of span program size and improved lower bounds for monotone span programs","author":"ga?l","year":"1998","journal-title":"30th STOC"},{"key":"21","first-page":"279","article-title":"Algebraic models of computation and interpolation for algebraic proof systems","author":"pudla?k","year":"1998","journal-title":"Proof Complexity and Feasible Arithmetic Volume 39 of DIMACS Series in Discrete Mathematics and Theor Comp Sci"},{"key":"20","first-page":"327","article-title":"Distributed pseudo-random functions and KDCs","volume":"1592","author":"naor","year":"1999","journal-title":"LNCS"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1007\/BF02122698"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"24","first-page":"441","article-title":"An introduction to shared secret and\/or shared control and their application","author":"simmons","year":"1992","journal-title":"Contemporary Cryptology The Science Of Information Integrity"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28404"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1007\/BF00125203"},{"journal-title":"Linear Algebra Methods in Combinatorics","year":"1992","author":"babai","key":"3"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(84)90018-8"},{"key":"10","first-page":"316","article-title":"General secure multi-party computation from any linear secret-sharing scheme","author":"cramer","year":"2000","journal-title":"Advances in Cryptology - EUROCRYPT 2000 Volume 1807 of LNCS"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01374526"},{"key":"7","first-page":"188","article-title":"On the power of nonlinear secret-sharing","author":"beimel","year":"2001","journal-title":"IEEE Conf Computational Complexity"},{"key":"6","first-page":"415","article-title":"Random CNF's are hard for the polynomial calculus","author":"ben-sasson","year":"1999","journal-title":"45th FOCS"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1007\/s004930050058"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1007\/BF01202040"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1090\/S0273-0979-1989-15750-9"},{"key":"8","first-page":"313","article-title":"Safeguarding cryptographic keys","author":"blakley","year":"1979","journal-title":"Proc of the 1979 AFIPS National Computer Conference Volume 48 of AFIPS Conference Proceedings"}],"event":{"name":"44th Annual IEEE Symposium on Foundations of Computer Science - FOCS 2003","acronym":"SFCS-03","location":"Cambridge, MA, USA"},"container-title":["44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8767\/27770\/01238216.pdf?arnumber=1238216","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T00:05:26Z","timestamp":1497571526000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1238216\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/sfcs.2003.1238216","relation":{},"subject":[]}}