Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
485
The dining cryptographers problem: Unconditional sender and recipient untraceability
- Journal of Cryptology
, 1988
"... Abstract. Keeping confidential who sends which messages, in a world where any physical transmission can be traced to its origin, seems impossible. The solu-tion presented here is unconditionally or cryptographically secure, depending on whether it is based on one-time-use keys or on public keys, res ..."
Abstract
-
Cited by 577 (2 self)
- Add to MetaCart
Abstract. Keeping confidential who sends which messages, in a world where any physical transmission can be traced to its origin, seems impossible. The solu-tion presented here is unconditionally or cryptographically secure, depending on whether it is based on one-time-use keys or on public keys
Reliable Multicast Transport Protocol (RMTP)
"... This paper presents the design, implementation and performance of a reliable multicast transport protocol called RMTP. RMTP is based on a hierarchical structure in which receivers are grouped into local regions or domains and in each domain there is a special receiver called a Designated Receiver (D ..."
Abstract
-
Cited by 654 (10 self)
- Add to MetaCart
from the original sender, end-to-end latency is significantly reduced, and the overall throughput is improved as well. Also, since only the DRs send their acknowledgments to the sender, instead of all receivers sending their acknowledgments to the sender, a single acknowledgement is generated per local
Efficient authentication and signing of multicast streams over lossy channels
- In IEEE Symposium on Security and Privacy
, 2000
"... Multicast stream authentication and signing is an important and challenging problem. Applications include the continuous authentication of radio and TV Internet broadcasts, and authenticated data distribution by satellite. The main challenges are fourfold. First, authenticity must be guaranteed even ..."
Abstract
-
Cited by 334 (8 self)
- Add to MetaCart
even when only the sender of the data is trusted. Second, the scheme needs to scale to potentially millions of receivers. Third, streamed media distribution can have high packet loss. Finally, the system needs to be efficient to support fast packet rates. We propose two efficient schemes, TESLA
A Comparison of Receiver-Initiated and Sender-Initiated Adaptive Load Sharing (Extended Abstract)
, 1985
"... One goal of locally distributed systems is to facilitate resource sharing. Most current locally distributed systems, however, share primarily data, data storage devices, and output devices; there is little sharing of computational resourees. Load shoring is the process of sharing computational resou ..."
Abstract
-
Cited by 139 (0 self)
- Add to MetaCart
of the system; transfer decisions are independent of the actual current system state. Static policies may be either deterministic (e.g., “transfer all compilations originating at node A to server B”) or probabilistic (e.g., “transfer half of the compilations originating at node A to server B, and process
The Dining Cryptographers in the Disco: Unconditional Sender and Recipient Untraceability with Computationally Secure Serviceability
, 1989
"... In Journal of Cryptology 1/1 (1988) 65-75 ( = [Chau_88]), David Chaum describes a beautiful technique, the DC-net, which should allow participants to send and receive messages anonymously in an arbitrary network. The untraceability of the senders is proved to be unconditional, but that of the recipi ..."
Abstract
-
Cited by 81 (1 self)
- Add to MetaCart
In Journal of Cryptology 1/1 (1988) 65-75 ( = [Chau_88]), David Chaum describes a beautiful technique, the DC-net, which should allow participants to send and receive messages anonymously in an arbitrary network. The untraceability of the senders is proved to be unconditional
The TESLA Broadcast Authentication Protocol
- RSA CRYPTOBYTES
, 2002
"... One of the main challenges of securing broadcast communication is source authentication, or enabling receivers of broadcast data to verify that the received data really originates from the claimed source and was not modified en route. This problem is complicated by mutually untrusted receivers and u ..."
Abstract
-
Cited by 196 (10 self)
- Add to MetaCart
One of the main challenges of securing broadcast communication is source authentication, or enabling receivers of broadcast data to verify that the received data really originates from the claimed source and was not modified en route. This problem is complicated by mutually untrusted receivers
Return to Sender?: Administrative Detention of Irregular Migrants
- in Germany and the Netherlands', Punishment & Society 12(2
, 2010
"... Government Policy, the Netherlands The expulsion of irregular migrants has become a political priority in many (northern) EU member states. In countries such as Germany and the Netherlands this has resulted in a rather puzzling situation in which the capacity for the administrative detention of irre ..."
Abstract
-
Cited by 7 (1 self)
- Add to MetaCart
control literature’. These perspectives combined offer explanations for this paradoxical situation – by highlighting the import-ance of identification and the frustration thereof by irregular migrants and countries of origin – and for the apparent irrationality of the use of, sometimes very lengthy
Sender-Receiver Systems Within and Between Organisms
"... Presented at PSA 2012, San Diego, as part of a symposium on "Signaling Within the Organism," with Nicholas Shea, Rosa Cao, and Rory Smead. I introduce a theoretical framework, due originally to Lewis and Skyrms, used in several talks in the PSA symposium "Signaling Within the Organis ..."
Abstract
- Add to MetaCart
Presented at PSA 2012, San Diego, as part of a symposium on "Signaling Within the Organism," with Nicholas Shea, Rosa Cao, and Rory Smead. I introduce a theoretical framework, due originally to Lewis and Skyrms, used in several talks in the PSA symposium "Signaling Within
A Fair Non-repudiation Protocol
"... A fair non-repudiation protocol should not give the sender of a message an advantage over the receiver, or vice versa. We will present a fair non-repudiation protocol that requires a Trusted Third Party but attempts to minimize its involvement in the execution of the protocol. We will draw particula ..."
Abstract
-
Cited by 175 (16 self)
- Add to MetaCart
A fair non-repudiation protocol should not give the sender of a message an advantage over the receiver, or vice versa. We will present a fair non-repudiation protocol that requires a Trusted Third Party but attempts to minimize its involvement in the execution of the protocol. We will draw
Establishing Trust in Pure Ad-hoc Networks
, 2004
"... An ad-hoc network of wireless nodes is a temporarily formed network, created, operated and managed by the nodes themselves. It is also often termed an infrastructure-less, self-organized, or spontaneous network. Nodes assist each other by passing data and control packets from one node to another, of ..."
Abstract
-
Cited by 91 (7 self)
- Add to MetaCart
, often beyond the wireless range of the original sender. The execution and survival of an ad-hoc network is solely dependent upon the cooperative and trusting nature of its nodes.
Results 1 - 10
of
485
