{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T17:03:51Z","timestamp":1725728631169},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642390739"},{"type":"electronic","value":"9783642390746"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39074-6_12","type":"book-chapter","created":{"date-parts":[[2013,6,3]],"date-time":"2013-06-03T03:35:24Z","timestamp":1370230524000},"page":"113-124","source":"Crossref","is-referenced-by-count":1,"title":["Secure Information Transmission Based on Physical Principles"],"prefix":"10.1007","author":[{"given":"Dima","family":"Grigoriev","sequence":"first","affiliation":[]},{"given":"Vladimir","family":"Shpilrain","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","unstructured":"Bennett, C.H., Brassard, G.: Quantum Cryptography: Public key distribution and coin tossing. In: Proceedings of the IEEE International Conference on Computers, Systems, and Signal Processing, Bangalore, p. 175 (1984)"},{"key":"12_CR2","unstructured":"Garey, M., Johnson, J.: Computers and Intractability, A Guide to NP-Completeness. W. H. Freeman (1979)"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Grigoriev, D., Shpilrain, V.: Secrecy without one-way functions. Groups, Complexity, Cryptology 5 (2013)","DOI":"10.1515\/gcc-2013-0002"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Luby, M.: One-way functions are essential for information based cryptography. In: Proc. 30th IEEE Sympos. on Found. of Comput. Sci., pp. 230\u2013235. IEEE, New York (1989)","DOI":"10.1109\/SFCS.1989.63483"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1090\/conm\/582\/11557","volume":"582","author":"D. Kahrobaei","year":"2012","unstructured":"Kahrobaei, D., Habeeb, M., Shpilrain, V.: A secret sharing scheme based on group presentations and the word problem. Contemp. Math., Amer. Math. Soc.\u00a0582, 143\u2013150 (2012)","journal-title":"Contemp. Math., Amer. Math. Soc."},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Comm. ACM\u00a022, 612\u2013613 (1979)","journal-title":"Comm. ACM"},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1109\/SFCS.1982.38","volume-title":"23rd Annual Symposium on Foundations of Computer Science (Chicago, Ill., 1982)","author":"A.C. Yao","year":"1982","unstructured":"Yao, A.C.: Protocols for secure computations (Extended Abstract). In: 23rd Annual Symposium on Foundations of Computer Science (Chicago, Ill., 1982), pp. 160\u2013164. IEEE, New York (1982)"}],"container-title":["Lecture Notes in Computer Science","Unconventional Computation and Natural Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39074-6_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T16:23:56Z","timestamp":1557764636000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39074-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642390739","9783642390746"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39074-6_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}