Results 1 - 10 of 9,212

Random Oracles are Practical: A Paradigm for Designing Efficient Protocols

by Mihir Bellare, Phillip Rogaway , 1995
"... We argue that the random oracle model -- where all parties have access to a public random oracle -- provides a bridge between cryptographic theory and cryptographic practice. In the paradigm we suggest, a practical protocol P is produced by first devising and proving correct a protocol P R for the ..."
Abstract - Cited by 1646 (70 self) - Add to MetaCart
We argue that the random oracle model -- where all parties have access to a public random oracle -- provides a bridge between cryptographic theory and cryptographic practice. In the paradigm we suggest, a practical protocol P is produced by first devising and proving correct a protocol P R

A randomized protocol for signing contracts

by Michael Ben-Or, Oded Goldreich, Silvio Micali, Ronald L. Rivest , 1990
"... Two parties, A and B, want to sign a contract C over a communication network. To do so, they must “simultaneously” exchange their commitments to C. Since simultaneous exchange is usually impossible in practice, protocols are needed to approximate simultaneity by exchanging partial commitments in pie ..."
Abstract - Cited by 599 (11 self) - Add to MetaCart
Two parties, A and B, want to sign a contract C over a communication network. To do so, they must “simultaneously” exchange their commitments to C. Since simultaneous exchange is usually impossible in practice, protocols are needed to approximate simultaneity by exchanging partial commitments

SPINS: Security Protocols for Sensor Networks

by Adrian Perrig, Robert Szewczyk, Victor Wen, David Culler, J. D. Tygar , 2001
"... As sensor networks edge closer towards wide-spread deployment, security issues become a central concern. So far, the main research focus has been on making sensor networks feasible and useful, and less emphasis was placed on security. We design a suite of security building blocks that are optimized ..."
Abstract - Cited by 1094 (30 self) - Add to MetaCart
broad-cast authentication, which is an important mechanism for sensor networks. TESLA is a new protocol which provides authenticated broadcast for severely resource-constrained environments. We implemented the above protocols, and show that they are practical even on minimalistic hardware

Universally composable security: A new paradigm for cryptographic protocols

by Ran Canetti , 2013
"... We present a general framework for representing cryptographic protocols and analyzing their security. The framework allows specifying the security requirements of practically any cryptographic task in a unified and systematic way. Furthermore, in this framework the security of protocols is preserved ..."
Abstract - Cited by 833 (37 self) - Add to MetaCart
We present a general framework for representing cryptographic protocols and analyzing their security. The framework allows specifying the security requirements of practically any cryptographic task in a unified and systematic way. Furthermore, in this framework the security of protocols

XORs in the air: practical wireless network coding

by Sachin Katti, Hariharan Rahul, Wenjun Hu, Dina Katabi, Muriel Médard, Jon Crowcroft - In Proc. ACM SIGCOMM , 2006
"... This paper proposes COPE, a new architecture for wireless mesh networks. In addition to forwarding packets, routers mix (i.e., code) packets from different sources to increase the information content of each transmission. We show that intelligently mixing packets increases network throughput. Our de ..."
Abstract - Cited by 548 (20 self) - Add to MetaCart
design is rooted in the theory of network coding. Prior work on network coding is mainly theoretical and focuses on multicast traffic. This paper aims to bridge theory with practice; it addresses the common case of unicast traffic, dynamic and potentially bursty flows, and practical issues facing

Prudent Engineering Practice for Cryptographic Protocols

by Martin Abadi, Roger Needhamt - Proc. IEEE Computer Society Symposium on Research in Security and Privacy , 1994
"... We present principles for the design of cryptographic protocols. The principles are neither necessary nor sufficient for correctness. They are however helpful, in that adherence to them would have avoided a considerable number of published errors. Our principles are informal guidelines. They complem ..."
Abstract - Cited by 399 (15 self) - Add to MetaCart
We present principles for the design of cryptographic protocols. The principles are neither necessary nor sufficient for correctness. They are however helpful, in that adherence to them would have avoided a considerable number of published errors. Our principles are informal guidelines

Fair end-to-end window-based congestion control

by Jeonghoon Mo, Jean Walrand - IEEE/ACM TRANS. ON NETWORKING , 2000
"... In this paper, we demonstrate the existence of fair end-to-end window-based congestion control protocols for packetswitched networks with first come-first served routers. Our definition of fairness generalizes proportional fairness and includes arbitrarily close approximations of max-min fairness. T ..."
Abstract - Cited by 676 (3 self) - Add to MetaCart
. The protocols use only information that is available to end hosts and are designed to converge reasonably fast. Our study is based on a multiclass fluid model of the network. The convergence of the protocols is proved using a Lyapunov function. The technical challenge is in the practical implementation

Entity Authentication and Key Distribution

by Mihir Bellare, Phillip Rogaway , 1993
"... Entity authentication and key distribution are central cryptographic problems in distributed computing -- but up until now, they have lacked even a meaningful definition. One consequence is that incorrect and inefficient protocols have proliferated. This paper provides the first treatment of these p ..."
Abstract - Cited by 578 (13 self) - Add to MetaCart
the (minimal) assumption of pseudorandom function. When this assumption is appropriately instantiated, the protocols given are practical and efficient.

A logic of authentication

by Michael Burrows, Martín Abadi, Roger Needham - ACM TRANSACTIONS ON COMPUTER SYSTEMS , 1990
"... Questions of belief are essential in analyzing protocols for the authentication of principals in distributed computing systems. In this paper we motivate, set out, and exemplify a logic specifically designed for this analysis; we show how various protocols differ subtly with respect to the required ..."
Abstract - Cited by 1332 (22 self) - Add to MetaCart
Questions of belief are essential in analyzing protocols for the authentication of principals in distributed computing systems. In this paper we motivate, set out, and exemplify a logic specifically designed for this analysis; we show how various protocols differ subtly with respect to the required

Investigating the Energy Consumption of a Wireless Network Interface in an Ad Hoc Networking Environment

by Laura Marie Feeney, Martin Nilsson - In IEEE Infocom , 2001
"... Energy-aware design and evaluation of network protocols requires knowledge of the energy consumption behavior of actual wireless interfaces. But little practical information is available about the energy consumption behavior of well-known wireless network interfaces and device specifications do not ..."
Abstract - Cited by 669 (3 self) - Add to MetaCart
Energy-aware design and evaluation of network protocols requires knowledge of the energy consumption behavior of actual wireless interfaces. But little practical information is available about the energy consumption behavior of well-known wireless network interfaces and device specifications do
Results 1 - 10 of 9,212