Learn More
We consider what constitutes identities in cryptography. Typical examples include your name and your social-security number, or your fingerprint/iris-scan, or your address, or your (non-revoked) public-key coming from some trusted public-key infrastructure. In many situations, however, where you are defines your identity. For example, we know the role of a(More)
Lager-style beers constitute the vast majority of the beer market, and yet, the genetic origin of the yeast strains that brew them has been shrouded in mystery and controversy. Unlike ale-style beers, which are generally brewed with Saccharomyces cerevisiae, lagers are brewed at colder temperatures with allopolyploid hybrids of Saccharomyces eubayanus x S.(More)
We address the problem of realizing concurrently compos-able secure computation without setup assumptions. While provably impossible in the UC framework of [Can01], Prabhakaran and Sahai had recently suggested a relaxed framework called generalized Environmental Security (gES) [PS04], as well as a restriction of it to a " client-server " setting based on(More)
The IEEE 802.11s working group is tasked to provide ways of establishing and securing a wireless mesh network. One proposal establishes a Mesh Security Architecture (MSA), with a developed key hierarchy and full protocol definitions. This paper examines the correctness and security of the MSA proposal and its corresponding protocols. We utilize Protocol(More)
In the last decade, the notion of metric embeddings with small distortion has received wide attention in the literature, with applications in combinatorial optimization, discrete mathematics, and bio-informatics. The notion of embedding is, given two metric spaces on the same number of points, to find a bijection that minimizes maximum Lipschitz and(More)
The IEEE 802.11s standard is tasked to provide ways of establishing and securing a wireless mesh network. One proposal establishes a Mesh Security Architecture (MSA), with an interesting key hierarchy and full protocol definitions. This paper proves the correctness and security of the MSA proposal and its corresponding protocols. We also propose and prove(More)
In this paper we show a general transformation from any honest verifier statistical zero-knowledge argument to a concurrent statistical zero-knowledge argument. Our transformation relies only on the existence of one-way functions. It is known that the existence of zero-knowledge systems for any non-trivial language implies one way functions. Hence our(More)