{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T05:31:49Z","timestamp":1648704709223},"reference-count":7,"publisher":"Elsevier BV","issue":"8","license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"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":["Computers & Security"],"published-print":{"date-parts":[[1998,1]]},"DOI":"10.1016\/s0167-4048(98)80102-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:55:29Z","timestamp":1027594529000},"page":"725-732","source":"Crossref","is-referenced-by-count":5,"title":["A geometric approach for shared secrets, a refinement"],"prefix":"10.1016","volume":"17","author":[{"family":"Leong Peng Chor","sequence":"first","affiliation":[]},{"family":"Hsu Wen Jing","sequence":"additional","affiliation":[]},{"family":"Tan Peng Chong","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"No. 2","key":"10.1016\/S0167-4048(98)80102-8_BIB1","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0167-4048(95)97047-E","article-title":"A geometric approach for sharing secrets","volume":"Vol. 14","author":"Wu","year":"1995","journal-title":"Computer & Security"},{"issue":"No. 11","key":"10.1016\/S0167-4048(98)80102-8_BIB2","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","article-title":"How to Share a Secret","volume":"Vol. 22","author":"Shamir","year":"1979","journal-title":"Communications of the ACM"},{"key":"10.1016\/S0167-4048(98)80102-8_BIB3","series-title":"Elementary Number Theory (Revised Printing)","author":"Burton","year":"1980"},{"key":"10.1016\/S0167-4048(98)80102-8_BIB4","series-title":"Contemporary Cryptology: The Science of Information Integrity","article-title":"An introduction to Shared Secret\/Shared Control Schemes","author":"Simmons","year":"1993"},{"issue":"No. 6","key":"10.1016\/S0167-4048(98)80102-8_BIB5","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1109\/TIT.1986.1057236","article-title":"A simple and fast probabilistic algorithm for computing square root modulo a prime number","volume":"Vol. 32","author":"Peralta","year":"1986","journal-title":"IEEE Trans. Information Theory"},{"key":"10.1016\/S0167-4048(98)80102-8_BIB6","series-title":"Primality and Cryptology","author":"Kranakis","year":"1986"},{"key":"10.1016\/S0167-4048(98)80102-8_BIB7","series-title":"Numerical Recipes in C: The Art of Scientific Computing","author":"Press","year":"1993"}],"container-title":["Computers & Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167404898801028?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167404898801028?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T16:27:26Z","timestamp":1556382446000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167404898801028"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,1]]},"references-count":7,"journal-issue":{"issue":"8","published-print":{"date-parts":[[1998,1]]}},"alternative-id":["S0167404898801028"],"URL":"https:\/\/doi.org\/10.1016\/s0167-4048(98)80102-8","relation":{},"ISSN":["0167-4048"],"issn-type":[{"value":"0167-4048","type":"print"}],"subject":[],"published":{"date-parts":[[1998,1]]}}}