Peer-Assisted Content Distribution with Prices (2009)
Christina Aperjis, Michael J. Freedman, Ramesh Johari
Peer-assisted content distribution matches user demand for content with available supply at other peers in the network. Inspired by this supply-and-demand interpretation of the nature of content...
Abstract SANE: A Protection Architecture for Enterprise Networks (2009)
Martin Casado, Tal Garfinkel, Aditya Akella, Michael J. Freedman, Dan Boneh, Nick Mckeown, ...
Connectivity in today’s enterprise networks is regulated by a combination of complex routing and bridging policies, along with various interdiction mechanisms such as ACLs, packet filters, and...
Abstract RE: Reliable Email (2008)
Scott Garriss, Michael Kaminsky, Michael J. Freedman, Brad Karp, David Mazières, Haifeng Yu
The explosive growth in unwanted email has prompted the development of techniques for the rejection of email, intended to shield recipients from the onerous task of identifying the legitimate email...
Michael J. Freedman, Karthik Lakshminarayanan, David Mazières
Global anycast, an important building block for many distributed services, faces several challenging requirements. First, anycast response must be fast and accurate. Second, the anycast system must...
Abstract Shark: Scaling File Servers via Cooperative Caching (2008)
Siddhartha Annapureddy, Michael J. Freedman, David Mazières
Network file systems offer a powerful, transparent interface for accessing remote data. Unfortunately, in current network file systems like NFS, clients fetch data from a central file server,...
My research interests span the areas of distributed systems, security, networking, and cryptography. I particularly enjoy devising technologies that make new functionality broadly available. My work...
My research interests span the areas of distributedsystems, security, networking, and cryptography. I particularly enjoy devising technologies that makenew functionality broadly available. My work...
Michael J. Freedman, Karthik Lakshminarayanan, Sean Rhea, Ion Stoica
The most basic functionality of a distributed hash table, or DHT, is to partition a key space across the set of nodes in a distributed system such that all nodes agree on the partitioning. For...
Prices are Right: Managing resources and incentives in peer-assisted content distribution (2008)
Michael J. Freedman, Christina Aperjis, Ramesh Johari
Abstract We present a novel design for a peer-assisted content distri-bution system that addresses two key shortcomings of existing proposals. First, our system explicitly identifies therelative...
Abstract The Role of Prices in Peer-Assisted Content Distribution (2008)
Christina Aperjis, Michael J. Freedman, Ramesh Johari
Peer-assisted content distribution matches user demand for content with available supply at other peers in the network. Inspired by this supply-and-demand interpretation of the nature of content...
Michael J. Freedman, Christina Aperjis, Ramesh Johari
We present a novel design for a peer-assisted content distribution system that addresses two key shortcomings of existing proposals. First, our system explicitly identifies the relative demand for...
Michael J. Freedman, Karthik Lakshminarayanan, David Mazières
Global anycast, an important building block for many distributed services, faces several challenging requirements. First, anycast response must be fast and accurate. Second, the anycast system must...
Yevgeniy Dodis, Michael J. Freedman, Shabsi Walfish
We present a new, elegant composition method for joint signature and encryption, also referred to as signcryption. The new method, which we call Padding-based Parallel Signcryption (PbPS), builds an...
Abstract Shark: Scaling File Servers via Cooperative Caching (2008)
Siddhartha Annapureddy, Michael J. Freedman, David Mazières
Network file systems offer a powerful, transparent interface for accessing remote data. Unfortunately, in current network file systems like NFS, clients fetch data from a central file server,...
Abstract Shark: Scaling File Servers via Cooperative Caching (2008)
Siddhartha Annapureddy, Michael J. Freedman, David Mazières
Network file systems offer a powerful, transparent interface for accessing remote data. Unfortunately, in current network file systems like NFS, clients fetch data from a central file server,...
Abstract SANE: A Protection Architecture for Enterprise Networks (2008)
Martin Casado, Tal Garfinkel, Aditya Akella, Michael J. Freedman, Dan Boneh, Nick Mckeown, ...
Connectivity in today’s enterprise networks is regulated by a combination of complex routing and bridging policies, along with various interdiction mechanisms such as ACLs, packet filters, and...
Roger Dingledine, Michael J. Freedman, David Hopwood, David Molnar
Abstract. We describe a design for a reputation system that increases the reliability and thus efficiency of remailer services. Our reputation system uses a MIX-net in which MIXes give receipts for...
Abstract RE: Reliable Email (2008)
Scott Garriss, Michael Kaminsky, Michael J. Freedman, Brad Karp, David Mazières, Haifeng Yu
The explosive growth in unwanted email has prompted the development of techniques for the rejection of email, intended to shield recipients from the onerous task of identifying the legitimate email...
Roger Dingledine, Michael J. Freedman, David Hopwood, David Molnar
Abstract. We describe a design for a reputation system that increases the reliability and thus efficiency of remailer services. Our reputation system uses a MIX-net in which MIXes give receipts for...
Michael J. Freedman, Yuval Ishai, Benny Pinkas, Omer Reingold
xi as the keyword and pi as the payload (database record). A query froma client is a searchword
Scott Garriss Michael, Michael Kaminsky, Michael J. Freedman, Brad Karp, David Mazières, Haifeng Yu
The explosive growth in unwanted email has prompted the development of techniques for the rejection of email, intended to shield recipients from the onerous task of identifying the legitimate email...
A comparison of bilateral and multilateral exchanges for peer-assisted content distribution (2008)
Christina Aperjis, Michael J. Freedman, Ramesh Johari
Abstract. Peer-assisted content distribution matches user demand for content with available supply at other peers in the network. Inspired by this supply-anddemand interpretation of the nature of...
The role of prices in peer-assisted content distribution (2008)
Christina Aperjis, Michael J. Freedman, Ramesh Johari
Peer-assisted content distribution matches user demand for content with available supply at other peers in the network. Inspired by this supply-and-demand interpretation of the nature of content...
The role of prices in peer-assisted content distribution (2008)
Christina Aperjis, Michael J. Freedman, Ramesh Johari
Peer-assisted content distribution matches user demand for content with available supply at other peers in the network. Inspired by this supply-and-demand interpretation of the nature of content...
Probabilistic Signature-Encryption Padding (PSEP). We recommend using (2007)
Yevgeniy Dodis, Michael J. Freedman, Shabsi Walfish
We present a new, elegant composition method for joint signature and encryption, also referred to as signcryption. The new method, which we call Padding-based Parallel Signcryption (PbPS), builds an...
Abstract Introducing Tarzan, a Peer-to-Peer Anonymizing Network Layer (2007)
Michael J. Freedman, Emil Sit, Josh Cates, Robert Morris
We introduce Tarzan, a peer-to-peer anonymous network layer that provides generic IP forwarding. Unlike prior anonymizing layers, Tarzan is flexible, transparent, decentralized, and highly scalable....
Abstract Efficient Peer-To-Peer Lookup Based on a Distributed Trie (2007)
Two main approaches have been taken for distributed key/value lookup operations in peer-to-peer systems: broadcast searches [1, 2] and location-deterministic algorithms [5, 6, 7, 9]. We describe a...
Joan Feigenbaum, Michael J. Freedman, Tomas Sander, Adam Shostack
Internet-based commerce provides great opportunities for merchants, consumers, and business a#liates, but it may seriously threaten users ' privacy. Some of the paths to loss of privacy are...
Roger Dingledine, Michael J. Freedman, David Hopwood, David Molnar
Abstract. We describe a design for a reputation system that increases the reliability and thus eciency of remailer services. Our reputation system uses a MIX-net in which MIXes give receipts for...
ABSTRACT Tarzan: A Peer-to-Peer Anonymizing Network Layer (2007)
Tarzan is a peer-to-peer anonymous IP network overlay. Because it provides IP service, Tarzan is general-purpose and transparent to applications. Organized as a decentralized peer-to-peer overlay,...
The Free Haven Project aims to deploy a system for anonymous, distributed data storage which is robust against attempts by powerful adversaries to find and destroy stored data. To support anonymous...
ETHANE: Taking Control of the Enterprise (2007)
Martín Casado, Michael J. Freedman, Justin Pettit, Jianying Luo, Nick Mckeown, Scott Shenker
This paper presents Ethane, a new network architecture for the enterprise. Ethane allows managers to define a single networkwide fine-grain policy, and then enforces it directly. Ethane couples...
ETHANE: Taking Control of the Enterprise (2007)
Martìn Casado, Michael J. Freedman, Justin Pettit, Jianying Luo, Nick Mckeown
This paper presents Ethane, a new network architecture for the enterprise. Ethane allows managers to define a single networkwide fine-grain policy, and then enforces it directly. Ethane couples...
ETHANE: Taking Control of the Enterprise (2007)
Martìn Casado, Michael J. Freedman, Justin Pettit, Jianying Luo, Nick Mckeown
This paper presents Ethane, a new network architecture for the enterprise. Ethane allows managers to define a single networkwide fine-grain policy, and then enforces it directly. Ethane couples...
Group Therapy for Systems: Using link attestations to manage failures (2006)
Michael J. Freedman, Ion Stoica, David Mazieres, Scott Shenker
Managing failures and configuring systems properly are of critical importance for robust distributed services. Unfortunately, protocols offering strong fault-tolerance guarantees are generally too...
OASIS: Anycast for Any Service (2006)
Michael Freedman Karthik, Michael J. Freedman, Karthik Lakshminarayanan, David Mazières
Global anycast, an important building block for many distributed services, faces several challenging requirements. First, anycast response must be fast and accurate. Second, the anycast system must...
Scott Garriss, Michael Kaminsky, Michael J. Freedman, Brad Karp, David Mazières, Haifeng Yu
The explosive growth in unwanted email has prompted the development of techniques for the rejection of email, intended to shield recipients from the onerous task of identifying the legitimate email...
Shark: Scaling file servers via cooperative caching (2005)
Siddhartha Annapureddy, Michael J. Freedman
Abstract Network file systems offer a powerful, transparent inter-face for accessing remote data. Unfortunately, in current
Keyword Search and Oblivious Pseudorandom Functions (2005)
Michael J. Freedman, Yuval Ishai, Benny Pinkas, Omer Reingold
We study the problem of privacy-preserving access to a database.
Non-transitive connectivity and DHTs (2005)
Michael J. Freedman, Karthik Lakshminarayanan, Sean Rhea, Ion Stoica
The most basic functionality of a distributed hash table, or DHT, is to partition a key space across the set of nodes in a distributed system such that all nodes agree on the partitioning. For...
Shark: Scaling file servers via cooperative caching (2005)
Siddhartha Annapureddy, Michael J. Freedman
Abstract Network file systems offer a powerful, transparent inter-face for accessing remote data. Unfortunately, in current
Yevgeniy Dodis, Michael J. Freedman, Stanislaw Jarecki, Shabsi Walfish
We build several highly-practical and optimized signcryption constructions directly from trapdoor permutations, in the random oracle model. All our constructions share features such as simplicity,...
Democratizing content publication with Coral (2004)
Michael J. Freedman, Eric Freudenthal, David Mazi Eres
CoralCDN is a peer-to-peer content distribution network that allows a user to run a web site that offers high performance and meets huge demand, all for the price of a cheap broadband Internet...
Efficient private matching and set intersection (2004)
Michael J. Freedman, Kobbi Nissim, Benny Pinkas
Abstract. We consider the problem of computing the intersection of private datasets of two parties, where the datasets contain lists of elements taken from a large domain. This problem has many...
Democratizing content publication with Coral (2004)
Michael J. Freedman, Eric Freudenthal, David Mazieres
CoralCDN is a peer-to-peer content distribution network that allows a user to run a web site that offers high performance and meets huge demand, all for the price of a cheap broadband Internet...
On-the-Fly Verification of Rateless Erasure Codes for Efficient Content Distribution (2004)
Maxwell N. Krohn, Michael J. Freedman, David Mazieres
The quality of peer-to-peer content distribution can suffer when malicious participants intentionally corrupt content. Some systems using simple block-by-block downloading can verify blocks with...
On-the-Fly Verification of Rateless Erasure Codes for Efficient Content Distribution (2004)
Maxwell N. Krohn, Michael J. Freedman, David Mazieres
The quality of peer-to-peer content distribution can suffer when malicious participants intentionally corrupt content. Some systems using simple block-by-block downloading can verify blocks with...
Democratizing content publication with Coral (2004)
Michael J. Freedman, Eric Freudenthal
Abstract CoralCDN is a peer-to-peer content distribution networkthat allows a user to run a web site that offers high performance and meets huge demand, all for the price ofa cheap broadband Internet...
Yevgeniy Dodis, Michael J. Freedman, Stanislaw Jarecki, Shabsi Walfish
We build several highly-practical and optimized signcryption constructions directly from trapdoor permutations, in the random oracle model. All our constructions share features such as simplicity,...
On-the-Fly Verification of Rateless Erasure Codes for Efficient Content Distribution (2004)
Maxwell N. Krohn, Michael J. Freedman, David Mazieres
The quality of peer-to-peer content distribution can suffer when malicious participants intentionally corrupt content. Some systems using simple block-by-block downloading can verify blocks with...
Sloppy hashing and self-organizing clusters (2003)
Michael J. Freedman, David Mazieres
We are building Coral, a peer-to-peer content distribution system. Coral creates self-organizing clusters of nodes that fetch information from each other to avoid communicating with more distant or...
Sloppy hashing and self-organizing clusters (2003)
Michael J. Freedman, David Mazieres
We are building Coral, a peer-to-peer content distribution system. Coral creates self-organizing clusters of nodes that fetch information from each other to avoid communicating with more distant or...
Economic Barriers to the Deployement of Existing Privacy (2002)
Joan Feigenbaum, Michael J. Freedman, Tomas S, Adam Shostack
Despite the fact that many of the impressive techniques in the cryptographic researchliterature have been extensively and rigorously analyzed, and some have even been commercially developed, few are...
Tarzan: A peer-to-peer anonymizing network layer (2002)
Michael J. Freedman, Emil Sit, Josh Cates, Robert Morris
We introduce Tarzan, a peer-to-peer anonymous network layer that provides generic IP forwarding. Unlike prior anonymizing layers, Tarzan is flexible, transparent, decentralized, and highly scalable....
Economic Barriers to the Deployement of Existing Privacy (2002)
Joan Feigenbaum, Michael J. Freedman, Tomas S, Adam Shostack
Internet-based commerce provides great opportunities for merchants, consumers, and business aliates, but it may seriously threaten users ' privacy. Some of the paths to loss of privacy are quite...
Tarzan: A peer-to-peer anonymizing network layer (2002)
Robert T. Morris, Michael J. Freedman, Michael J. Freedman
Existing Internet systems implement anonymity at the application layer or through centralized components. A robust, decentralized infrastructure that anonymizes any Internet traffic could benefit a...
Efficient Peer-To-Peer Lookup Based on a Distributed Trie (2002)
Michael J. Freedman, Radek Vingralek
Two main approaches have been taken for distributed key-value lookup operations in peer-to-peer systems: broadcast searches [1, 2] and location-deterministic algorithms [5-7, 9]. We describe a third...
Tarzan: A peer-to-peer anonymizing network layer (2002)
Robert T. Morris, Michael J. Freedman, Michael J. Freedman
Existing Internet systems implement anonymity at the application layer or through centralized components. A robust, decentralized infrastructure that anonymizes any Internet traffic could benefit a...
Tarzan: A peer-to-peer anonymizing network layer (2002)
Michael J. Freedman, Robert Morris
Tarzan is a peer-to-peer anonymous IP network overlay. Because it provides IP service, Tarzan is general-purpose and transparent to applications. Organized as a decentralized peer-to-peer overlay,...
Economic Barriers to the Deployement of Existing Privacy (2002)
Joan Feigenbaum, Michael J. Freedman, Tomas S, Adam Shostack
Despite the fact that many of the impressive techniques in the cryptographic research literature have been extensively and rigorously analyzed, and some have even been commercially developed, few are...
A reputation system to increase MIX-net reliability (2001)
Roger Dingledine, Michael J. Freedman, David Hopwood, David Molnar
Abstract. We describe a design for a reputation system that increases the reliability and thus efficiency of remailer services. Our reputation system uses a MIX-net in which MIXes give receipts for...
Privacy Engineering for Digital Rights Management Systems (2001)
Joan Feigenbaum, Michael J. Freedman, Tomas S, Adam Shostack
Internet-based distribution of mass-market content provides great opportunities for producers, distributors, and consumers, but it may seriously threaten users’ privacy. Some of the paths to loss...
Privacy Engineering for Digital Rights Management Systems (2001)
Joan Feigenbaum, Michael J. Freedman, Tomas S, Adam Shostack
A reputation system to increase MIX-net reliability (2001)
Roger Dingledine, Michael J. Freedman, David Hopwood, David Molnar
Abstract. We describe a design for a reputation system that increases the reliability and thus efficiency of remailer services. Our reputation system uses a MIX-net in which MIXes give receipts for...
The Compression Cache: Virtual Memory Compression for Handheld Computers (2000)
Michael J. Freedman, Recitation Rivest Tr
Power consumption and speed are the largest costs for a virtual memory system in handheld computers. This paper describes a method of trading o computation and useable physical memory to reduce disk...
The Free Haven project: Distributed anonymous storage service (2000)
Roger Dingledine, Michael J. Freedman, David Molnar
We present a design for a system of anonymous storage which resists the attempts of powerful adversaries to find or destroy any stored data. We enumerate distinct notions of anonymity for each party...
The Free Haven project: Distributed anonymous storage service (2000)
Roger Dingledine, Michael J. Freedman, David Molnar
The Free Haven Project is a design for a system of anonymous storage which resists the attempts of powerful adversaries to nd or destroy stored data. We explicitly specify requirements for such a...