{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:40:25Z","timestamp":1742596825696,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540575689"},{"type":"electronic","value":"9783540482338"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57568-5_268","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:10:03Z","timestamp":1330261803000},"page":"369-378","source":"Crossref","is-referenced-by-count":3,"title":["On the relationship among cryptographic physical assumptions"],"prefix":"10.1007","author":[{"given":"Tatsuaki","family":"Okamoto","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"issue":"2","key":"40_CR1","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0020-0190(83)90029-7","volume":"16","author":"B. Alpern","year":"1983","unstructured":"B. Alpern and F.B. Schneider, \u201cKey Exchange Using \u2018Keyless Cryptography'\u201d, Information Processing Letters, 16, 2, pp. 79\u201381 (1983).","journal-title":"Information Processing Letters"},{"key":"40_CR2","doi-asserted-by":"crossref","unstructured":"J. Bos, and B. den Boer, \u201cDetection of Disrupters in the DC Protocol\u201d, Proc. of EUROCRYPT '89, LNCS 434, Springer-Verlag, pp.320\u2013327 (1990).","DOI":"10.1007\/3-540-46885-4_33"},{"key":"40_CR3","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, O. Goldreich, S. Goldwasser, J. H\u00e5stad, J. Kilian, S. Micali, and P. Rogaway, \u201cEverything Provable is Provable in Zeroknowledge\u201d, Proc. of CRYPTO '88, LNCS 403, Springer-Verlag, pp.37\u201356 (1990).","DOI":"10.1007\/0-387-34799-2_4"},{"key":"40_CR4","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, J. Kilian, and A. Wigderson, \u201cMulti-Prover Interactive Proofs: How to Remove Intractability Assumptions\u201d, Proc. of STOC (1988).","DOI":"10.1145\/62212.62223"},{"key":"40_CR5","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, and A. Wigderson, \u201cCompleteness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation\u201d, Proc. of STOC, pp.1\u201310 (1988).","DOI":"10.1145\/62212.62213"},{"key":"40_CR6","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, and T. Rabin, \u201cVerifiable Secret Sharing and Multiparty Protocols with Honest Majority\u201d, Proc. of STOC, pp.73\u201385 (1989)","DOI":"10.1145\/73007.73014"},{"key":"40_CR7","doi-asserted-by":"crossref","unstructured":"D. Chaum, C. Cr\u00e9peau, and I. Damg\u00e5rd, \u201cMultiparty Unconditionally Secure Protocols\u201d, Proc. of STOC, pp.11\u201319 (1988).","DOI":"10.1145\/62212.62214"},{"issue":"No.2","key":"40_CR8","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/358549.358563","volume":"24","author":"D. Chaum","year":"1981","unstructured":"D. Chaum, \u201cUntraceable Electronic Mail, Return Addresses, and Digital Pseudonyms\u201d, Communications of the ACM, Vol. 24, No.2, pp. 84\u201388 (1981).","journal-title":"Communications of the ACM"},{"issue":"No.1","key":"40_CR9","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF00206326","volume":"1","author":"D. Chaum","year":"1988","unstructured":"D. Chaum, \u201cThe Dining Cryptographers Problem: Unconditional Sender and Recipient Untraceability\u201d, Journal of Cryptology, Vol. 1, No.1, pp. 65\u201375 (1988).","journal-title":"Journal of Cryptology"},{"key":"40_CR10","doi-asserted-by":"crossref","unstructured":"D. Chaum, A. Fiat, and M. Naor, \u201cUntraceable Electronic Cash\u201d, Proc. of CRYPTO '88, LNCS 403, Springer-Verlag, pp.319\u2013327 (1990).","DOI":"10.1007\/0-387-34799-2_25"},{"key":"40_CR11","doi-asserted-by":"crossref","unstructured":"C. Cr\u00e9peau, and J. Kilian, \u201cAchieving Oblivious transfer Using Weakened Security Assumptions\u201d, Proc. of FOCS (1988).","DOI":"10.1109\/SFCS.1988.21920"},{"issue":"1","key":"40_CR12","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"S.Goldwasser, S.Micali and C.Rackoff, \u201cThe Knowledge Complexity of Interactive Proof Systems,\u201d SIAM J. Comput., 18, 1, pp. 186\u2013208 (1989).","journal-title":"SIAM J. Comput."},{"issue":"2","key":"40_CR13","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S. Goldwasser","year":"1988","unstructured":"S.Goldwasser, S.Micali and R.Rivest, \u201cA Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks,\u201d SIAM J. Comput., 17, 2, pp. 281\u2013308 (1988).","journal-title":"SIAM J. Comput."},{"key":"40_CR14","doi-asserted-by":"crossref","unstructured":"J.H\u00e5stad, \u201cPseudo-Random Generators under Uniform Assumptions,\u201d Proc. of STOC (1990)","DOI":"10.1145\/100216.100270"},{"key":"40_CR15","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo, L. Levin and M. Luby, \u201c Pseudo-Random Number Generation from One-Way Functions,\u201d Proc. of STOC, pp.12\u201324 (1989)","DOI":"10.1145\/73007.73009"},{"key":"40_CR16","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo, and S. Rudich, \u201c Limits on the Provable Consequence of One-Way Permutations,\u201d Proc. of STOC (1989)","DOI":"10.1145\/73007.73012"},{"key":"40_CR17","doi-asserted-by":"crossref","unstructured":"M.Naor, \u201cBit Commitment Using Pseudo-Randomness,\u201d Proc. of Crypto'89, LNCS 435, Springer-Verlag, pp.128\u2013136 (1990).","DOI":"10.1007\/0-387-34805-0_13"},{"key":"40_CR18","doi-asserted-by":"crossref","unstructured":"M.Naor, and M. Yung, \u201cUniversal One-Way Hash Functions and Their Cryptographic Applications,\u201d Proc. of STOC, pp.33\u201343 (1989).","DOI":"10.1145\/73007.73011"},{"key":"40_CR19","doi-asserted-by":"crossref","unstructured":"J. Rompel, \u201cOne-Way Functions are Necessary and Sufficient for Secure Signature,\u201d Proc. of STOC, pp.387\u2013394 (1990).","DOI":"10.1145\/100216.100269"},{"key":"40_CR20","doi-asserted-by":"crossref","unstructured":"M. Waidner, \u201cUnconditional Sender and Recipient Untraceability in spite of Active Attacks\u201d, Proc. of EUROCRYPT '89, LNCS 434, Springer-Verlag, pp.302\u2013319 (1990).","DOI":"10.1007\/3-540-46885-4_32"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57568-5_268.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:11:26Z","timestamp":1742595086000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57568-5_268"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540575689","9783540482338"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-57568-5_268","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}