Communication over One-time Pads Giovanni Di Crescenzo Aggelos Kiayias...  Home/Search
Context
Related
| uconn.edu/aggelos/pape...dk05icalp2.pdf Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: uconn.edu/aggelos/papers/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The "One-Time Pad" is a fundamental cryptographic protocol as it represents the ideal in secure unidirectional communication (i.e., in cases where there is a designated sender and a designated receiver) both in terms of security (in the presence of eavesdroppers) as well as in terms of computational e#ciency. Surprisingly, no modeling and investigation of this protocol has been done in important practical settings, as distributed and asynchronous ones. In this work we introduce an... (Update)
Active bibliography (related documents): More All
0.5: On the (Non)Universality of the One-Time Pad - Dodis, Spencer (Correct)
0.4: Distributed Scheduling for Disconnected Cooperation - Malewicz (2003) (Correct)
0.3: Computationally Secure Oblivious Transfer - Naor, Pinkas (1999) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ one-time-asynchronously,
author = "Communication Over One-Time",
title = "Asynchronously and Perfectly Secure",
url = "citeseer.ist.psu.edu/758489.html" }
Citations (may not include all citations):1447 A Mathematical Theory of Communication (context) - Shannon - 1948
739 Impossibility of Distributed Consensus with One Faulty Proce.. (context) - Fischer, Lynch et al. - 1985
97 Pseudorandomness and Cryptographic Applications (context) - Luby - 1996
70 Families of finite sets in which no set is covered by the un.. (context) - Erdos, Frankl et al. - 1985
18 An Algorithm for the Asynchronous Write-All Problem based on.. - Groote, Hesselink et al. - 2001
15 Time-Optimal Message-E#cient WorkPerformance in the Presence.. (context) - De Prisco, Mayer et al.
14 Algorithms for the Certified Write-All Problem - Anderson, Woll - 1997
8 ciently in the Presence of Faults (context) - Dwork, Halpern et al. - 1998
7 cient Parallel Algorithms Can Be Made Robust (context) - Kanellakis, Shvartsman - 1992
3 Electronic publication: http://www (context) - Goldreich, Cryptography et al. - 1995
2 Secret Signaling Systems (context) - Vernam - 1919
1 Invited survey paper for Distributed Computing (context) - Aspnes, for et al. - 2002
1 Parallel Algorithms for Process Failures and Delays (context) - Buss, Kanellakis et al. - 1997
1 and the Ordering of Events in a Distributed System CACM (context) - Lamport, Clocks - 1978
1 Performing Work with Asynchronous Processors: Message-Delay-.. - Kowalski, Shvartsman - 2003
Documents on the same site (http://cryptodrm.engr.uconn.edu/aggelos/papers/): More
Invited Survey Paper - Directions In Polynomial (Correct)
Digital Object Identifier (DOI) 10.1007/s00446-004-0120-5 - Distrib Comput Scalable (Correct)
The Vector-Ballot E-Voting Approach - Aggelos Kiayias And (2004) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC