Author image not provided
 Ryan Moriarty

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article6.00
Citation Count36
Publication count6
Publication years2006-2010
Available for download1
Average downloads per article299.00
Downloads (cumulative)299
Downloads (12 Months)8
Downloads (6 Weeks)1
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


6 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 6 of 6
Sort by:

1
January 2010
Bibliometrics:
Citation Count: 0

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 ...

2
August 2009 CRYPTO '09: Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 18

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 ...

3 published by ACM
August 2008 ACM Transactions on Algorithms (TALG): Volume 4 Issue 4, August 2008
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 1,   Downloads (12 Months): 8,   Downloads (Overall): 299

Full text available: PDFPDF
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 ...
Keywords: shape matching, Optimal metric embeddings, metric spaces, forbidden patterns, line embeddings, dynamic programming

4
June 2008 CSF '08: Proceedings of the 2008 21st IEEE Computer Security Foundations Symposium
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 4

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. ...
Keywords: 802.11s, Protocol Composition Logic (PCL), Mesh Security Architecture (MSA), peer-to-peer

5
December 2007 ASIACRYPT'07: Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 4

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 ...

6
March 2006 TCC'06: Proceedings of the Third conference on Theory of Cryptography
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 8

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 ...



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us