{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:59:48Z","timestamp":1725494388194},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540766261"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-76627-8_20","type":"book-chapter","created":{"date-parts":[[2007,11,5]],"date-time":"2007-11-05T15:44:09Z","timestamp":1194277449000},"page":"253-265","source":"Crossref","is-referenced-by-count":2,"title":["Magnifying Computing Gaps Establishing Encrypted Communication over Unidirectional Channels (Extended Abstract)"],"prefix":"10.1007","author":[{"given":"Shlomi","family":"Dolev","sequence":"first","affiliation":[]},{"given":"Ephraim","family":"Korach","sequence":"additional","affiliation":[]},{"given":"Galit","family":"Uzan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: Generating Hard Instances of Lattice Problems. In: Proc. of STOC, pp. 99\u2013108 (1996)","DOI":"10.1145\/237814.237838"},{"key":"20_CR2","volume-title":"Proc. of the 30th ACM STOC","author":"M. Ajtai","year":"1998","unstructured":"Ajtai, M.: The Shortest Vector Problem in L 2 is NP-hard for Randomized Reductions. In: Proc. of the 30th ACM STOC, ACM Press, New York (1998)"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Ajtai, M., Dwork, C.: Public-Key Cryposystem with Worst-Case\/Average-Case Equivalence, Electronic Colloquium on Computational Complexity, Report TR96-065 (1996)","DOI":"10.1145\/258533.258604"},{"issue":"1","key":"20_CR4","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s00145-002-0128-6","volume":"16","author":"A. Beimel","year":"2003","unstructured":"Beimel, A., Dolev, S.: Busses for Anonymous Message Delivery. Journal of Cryptology\u00a016(1), 25\u201339 (2003)","journal-title":"Journal of Cryptology"},{"issue":"11","key":"20_CR5","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1145\/361179.361202","volume":"17","author":"E.W. Dijkstra","year":"1974","unstructured":"Dijkstra, E.W: Self-stabilizing systems in spite of distributed control. Communications of the ACM\u00a017(11), 643\u2013644 (1974)","journal-title":"Communications of the ACM"},{"key":"20_CR6","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/6156.001.0001","volume-title":"Self-stabilization","author":"S. Dolev","year":"2000","unstructured":"Dolev, S.: Self-stabilization. MIT Press, Cambridge (2000)"},{"key":"20_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/11864219","volume-title":"SSS","author":"S. Dolev","year":"2006","unstructured":"Dolev, S., Kopetsky, M.: Secure Communication for RFIDs, Proactive Information Security within Computational Security. In: Datta, A.K., Gradinariu, M. (eds.) SSS 2006. LNCS, vol.\u00a04280, Springer, Heidelberg (2006)"},{"key":"20_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/3-540-44750-4_27","volume-title":"CRYPTO 1995","author":"A. Herzberg","year":"1995","unstructured":"Herzberg, A., Jarecki, S., Krawczyk, H., Yung, M.: Proactive Secret Sharing Or: How to Cope With Perpertual Leakage. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol.\u00a0963, pp. 339\u2013352. Springer, Heidelberg (1995)"},{"key":"20_CR9","first-page":"118","volume-title":"Introduction to Algorithms","author":"T. Cormen","year":"1990","unstructured":"Cormen, T., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms, p. 118. MIT Press, Cambridge (1990)"},{"key":"20_CR10","unstructured":"Dolev, S., Korach, E., Uzan, G.: A Method for Encryption and Decryption of Messages. PCT Patent Application WO 2006\/001006 (January 5, 2006)"},{"key":"20_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45841-7_1","volume-title":"STACS 2002","author":"Y.Z. Ding","year":"2002","unstructured":"Ding, Y.Z., Rabin, M.O.: Hyper-Encryption and Everlasting Security. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol.\u00a02285, pp. 1\u201326. Springer, Heidelberg (2002)"},{"key":"20_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/BFb0029948","volume-title":"Mathematical Foundations of Computer Science","author":"C. Dwork","year":"1997","unstructured":"Dwork, C.: Positive Applications of Lattice to Cryptography. In: Privara, I., Ru\u017ei\u010dka, P. (eds.) MFCS 1997. LNCS, vol.\u00a01295, pp. 44\u201351. Springer, Heidelberg (1997)"},{"key":"20_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/3-540-48071-4_10","volume-title":"CRYPTO 1992","author":"C. Dwork","year":"1993","unstructured":"Dwork, C., Naor, M.: Pricing via processing or combating junk mail. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol.\u00a0740, pp. 139\u2013147. Springer, Heidelberg (1993)"},{"issue":"2","key":"20_CR14","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/354876.354877","volume":"3","author":"S. Dolev","year":"2000","unstructured":"Dolev, S., Ostrovsky, R.: Xor-Trees for efficient anonymous multicast and reception. ACM TISSES\u00a03(2), 63\u201384 (2000)","journal-title":"ACM TISSES"},{"key":"20_CR15","volume-title":"Optical Computing: A Survey for Computer Scientists","author":"D.G. Feitelson","year":"1988","unstructured":"Feitelson, D.G.: Optical Computing: A Survey for Computer Scientists. MIT Press, Cambridge (1988)"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Levin, L.: A hard-core predicate for all one-way functions. In: Proc. ACM Symp. on Theory of Computing, pp. 25\u201332 (1989)","DOI":"10.1145\/73007.73010"},{"issue":"4","key":"20_CR17","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BF02579323","volume":"7","author":"L.A. Levin","year":"1987","unstructured":"Levin, L.A.: One-Way Functions and Pseudorandom Generators. Combinatorica\u00a07(4), 357\u2013363 (1987)","journal-title":"Combinatorica"},{"key":"20_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/3-540-45539-6_3","volume-title":"EUROCRYPT 2000","author":"A.K. Lenstra","year":"2000","unstructured":"Lenstra, A.K., Shamir, A.: Analysis and Optimization of the TWINKLE Factoring Device. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 35\u201352. Springer, Heidelberg (2000)"},{"issue":"4","key":"20_CR19","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1145\/359460.359473","volume":"21","author":"R.C. Merkle","year":"1978","unstructured":"Merkle, R.C.: Secure Communications Over Insecure Channels. CACM\u00a021(4), 294\u2013299 (1978)","journal-title":"CACM"},{"issue":"1","key":"20_CR20","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF00191321","volume":"5","author":"U.M. Maurer","year":"1992","unstructured":"Maurer, U.M.: Conditionaly-Perfect Secrecy and a Provable-Secure Randomized Cipher. Journal of Cryptology\u00a05(1), 53\u201366 (1992)","journal-title":"Journal of Cryptology"},{"key":"20_CR21","unstructured":"Rivest, R.L., Shamir, A., Wagner, D.A.: Time-lock puzzles and time-release Crypto. Technical Report, MIT\/LCS\/TR-684"},{"key":"20_CR22","unstructured":"Reif, J.H., Tyagi, A.: Efficient Algorithms for Optical Computing with the DFT Primitive. Journal of Applied Optics\u00a0 (1997)"},{"key":"20_CR23","series-title":"Lecture Notes in Computer Science","volume-title":"CRYPTO 2003","author":"S. Vadhan","year":"2003","unstructured":"Vadhan, S.: On Constructing Locally Computable Extractors and Cryptosystems in Bounded-Storage Model. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, Springer, Heidelberg (2003)"},{"key":"20_CR24","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Theory and Application of Trapdoor Functions. In: 23rd FOCS, pp. 80\u201391 (1982)","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-76627-8_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:55:24Z","timestamp":1619520924000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-76627-8_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540766261"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-76627-8_20","relation":{},"subject":[]}}