165 search results - page 7 / 33 » Safely Composing Security Protocols |
CSFW
2006
IEEE
14 years 2 months ago
2006
IEEE
A distributed calculus is proposed for describing networks of services. We model service interaction through a call-by-property invocation mechanism, by specifying the security co...
IFIPTCS
2010
13 years 8 months ago
2010
Abstract. In the field of Security, process equivalences have been used to characterize various information-hiding properties (for instance secrecy, anonymity and non-interference)...
CRYPTO
2007
Springer
14 years 5 months ago
2007
Springer
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...
STOC
2004
ACM
14 years 11 months ago
2004
ACM
We propose a modification to the framework of Universally Composable (UC) security [3]. Our new notion, involves comparing the protocol executions with an ideal execution involvin...
EUROCRYPT
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. We propose and realize a definition of security for passwordbased key exchange within the framework of universally composable (UC) security, thus providing security guar...