Sciweavers

659 search results - page 45 / 132
» Compiling and securing cryptographic protocols
Sort
View
94
Voted
ACNS
2004
Springer
156views Cryptology» more  ACNS 2004»
15 years 5 months ago
One-Round Protocols for Two-Party Authenticated Key Exchange
Cryptographic protocol design in a two-party setting has often ignored the possibility of simultaneous message transmission by each of the two parties (i.e., using a duplex channe...
Ik Rae Jeong, Jonathan Katz, Dong Hoon Lee
PODC
2011
ACM
14 years 3 months ago
Securing social networks
We present a cryptographic framework to achieve access control, privacy of social relations, secrecy of resources, and anonymity of users in social networks. The main idea is to u...
Michael Backes, Matteo Maffei, Kim Pecina
ACNS
2010
Springer
134views Cryptology» more  ACNS 2010»
15 years 1 months ago
Efficient and Secure Evaluation of Multivariate Polynomials and Applications
In this work, we design two-party and multiparty protocols for evaluating multivariate polynomials at participants' inputs with security against a malicious adversary who may ...
Matthew K. Franklin, Payman Mohassel
CTRSA
2009
Springer
106views Cryptology» more  CTRSA 2009»
15 years 4 months ago
Communication-Efficient Private Protocols for Longest Common Subsequence
We design communication efficient two-party and multi-party protocols for the longest common subsequence (LCS) and related problems. Our protocols achieve privacy with respect to p...
Matthew K. Franklin, Mark Gondree, Payman Mohassel
99
Voted
USENIX
2003
15 years 1 months ago
The Design of the {OpenBSD} Cryptographic Framework
Cryptographic transformations are a fundamental building block in many security applications and protocols. To improve performance, several vendors market hardware accelerator car...
Angelos D. Keromytis, Jason L. Wright, Theo de Raa...