In this thesis 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 transformation ...
CRYPTO '09: Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology
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 ...
ACM Transactions on Algorithms (TALG): Volume 4 Issue 4, August 2008
Citation Count: 1
Downloads (6 Weeks): 1, Downloads (12 Months): 8, Downloads (Overall): 299
Full text available:
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 ...
shape matching, Optimal metric embeddings, metric spaces, forbidden patterns, line embeddings, dynamic programming
CSF '08: Proceedings of the 2008 21st IEEE Computer Security Foundations Symposium
Publisher: IEEE Computer Society
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. ...
802.11s, Protocol Composition Logic (PCL), Mesh Security Architecture (MSA), peer-to-peer
ASIACRYPT'07: Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
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 ...
TCC'06: Proceedings of the Third conference on Theory of Cryptography
We address the problem of realizing concurrently composable 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 ...