{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T16:09:09Z","timestamp":1648829349235},"reference-count":19,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1990,9,1]],"date-time":"1990-09-01T00:00:00Z","timestamp":652147200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Algorithms"],"published-print":{"date-parts":[[1990,9]]},"DOI":"10.1016\/0196-6774(90)90023-8","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T08:44:36Z","timestamp":1108025076000},"page":"492-521","source":"Crossref","is-referenced-by-count":6,"title":["Security, veriflability, and universality in distributed computing"],"prefix":"10.1016","volume":"11","author":[{"given":"Ming-Deh A","family":"Huang","sequence":"first","affiliation":[]},{"given":"Shang-Hua","family":"Teng","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(90)90023-8_BIB1","series-title":"Proceedings, 20th Annual ACM Symposium on Theory of Computing","first-page":"1","article-title":"Completeness theorems for non-cryptographic fault-tolerant distributed computation","author":"Ben-or","year":"1988"},{"key":"10.1016\/0196-6774(90)90023-8_BIB2","series-title":"5th Annual Symposium on Principles of Distributed Computing, ACM","first-page":"52","article-title":"Distributing the power of a government to enhance the privacy of voters","author":"Benaloh","year":"1985"},{"key":"10.1016\/0196-6774(90)90023-8_BIB3","series-title":"27th Annual Symposium on Foundations of Computer Science","first-page":"188","article-title":"Non-transitive transfer of confidence: A perfect zero-knowledge interactive protocol for sat and beyond","author":"Brassard","year":"1986"},{"key":"10.1016\/0196-6774(90)90023-8_BIB4","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1145\/358549.358563","article-title":"Untraceable electronic mail, return addresses, and digital pseudonyms","volume":"24","author":"Chaum","year":"1981","journal-title":"Comm. ACM"},{"key":"10.1016\/0196-6774(90)90023-8_BIB5","series-title":"Proceedings, 20th Annual ACM Symposium on Theory of Computing","first-page":"11","article-title":"Multi-party unconditionally secure protocols","author":"Chaum","year":"1988"},{"key":"10.1016\/0196-6774(90)90023-8_BIB6","series-title":"FOCS25","first-page":"372","article-title":"A robust and verifiable cryptographically secure election scheme","author":"Cohen","year":"1985"},{"key":"10.1016\/0196-6774(90)90023-8_BIB7","series-title":"Proceedings, 14th Annual ACM Symposium on Theory of Computing","first-page":"383","article-title":"Cryptographic protocols","author":"Demillo","year":"1982"},{"key":"10.1016\/0196-6774(90)90023-8_BIB8","series-title":"27th Annual Symposium on Foundations of Computer Science","first-page":"174","article-title":"Proofs that yield nothing but their validity and a methodology of cryptographic protocol design","author":"Goldreich","year":"1986"},{"key":"10.1016\/0196-6774(90)90023-8_BIB9","series-title":"Proceedings, 19th Annual ACM Symposium on Theory of Computing","first-page":"218","article-title":"How to play any mental game","author":"Goldreich","year":"1987"},{"issue":"No. 2","key":"10.1016\/0196-6774(90)90023-8_BIB10","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","article-title":"Probabilistic encryption","volume":"28","author":"Goldwasser","year":"1984","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0196-6774(90)90023-8_BIB11","series-title":"Proceedings, 17th Annual ACM Symposium on Theory of Computing","first-page":"291","article-title":"The knowledge of complexity of interactive proof-systems","author":"Goldwasser","year":"1985"},{"key":"10.1016\/0196-6774(90)90023-8_BIB12","article-title":"Secure and Verifiable Schemes for Election and General Distributed Computing Problems","author":"Huang","year":"1987"},{"key":"10.1016\/0196-6774(90)90023-8_BIB13","series-title":"7th Annual Symposium on Principles of Distributed Computing, ACM","first-page":"182","article-title":"Secure and Verifiable Schemes on Election and General Distributed Computing Problems","author":"Huang","year":"1988"},{"key":"10.1016\/0196-6774(90)90023-8_BIB14","series-title":"Advances in Cryptology\u2014CRYPTO'88","first-page":"336","article-title":"A universal problem in secure and verifiable distributed computation","author":"Huang","year":"1988"},{"key":"10.1016\/0196-6774(90)90023-8_BIB15","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1145\/322186.322188","article-title":"Reaching agreement in the presence of faults","volume":"27","author":"Pease","year":"1980","journal-title":"J. Assoc. Comput. Mach."},{"issue":"No. 2","key":"10.1016\/0196-6774(90)90023-8_BIB16","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1145\/359340.359342","article-title":"A method for obtaining digital signatures and public-key cryptosystems","volume":"21","author":"Rivest","year":"1978","journal-title":"Comm. ACM"},{"issue":"No. 11","key":"10.1016\/0196-6774(90)90023-8_BIB17","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","article-title":"How to share a secret","volume":"22","author":"Shamir","year":"1979","journal-title":"Comm. ACM"},{"key":"10.1016\/0196-6774(90)90023-8_BIB18","series-title":"23rd Annual Symposium on Foundations of Computer Science","first-page":"160","article-title":"Protocols for secure computations","author":"Yao","year":"1982"},{"key":"10.1016\/0196-6774(90)90023-8_BIB19","series-title":"23rd Annual Symposium on Foundations of Computer Science","first-page":"80","article-title":"Theory and application of trapdoor functions","author":"Yao","year":"1982"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677490900238?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677490900238?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T06:54:02Z","timestamp":1548744842000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677490900238"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,9]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1990,9]]}},"alternative-id":["0196677490900238"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(90)90023-8","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1990,9]]}}}