Sciweavers

2432 search results - page 13 / 487
» Cryptographic logical relations
Sort
View
IFIP
2009
Springer
15 years 4 months ago
Trusted Multiplexing of Cryptographic Protocols
Abstract. We present an analysis that determines when it is possible to multiplex a pair of cryptographic protocols. We present a transformation that improves the coverage of this ...
Jay A. McCarthy, Shriram Krishnamurthi
TIT
2008
164views more  TIT 2008»
14 years 9 months ago
Cryptographic Hardness Based on the Decoding of Reed-Solomon Codes
We investigate the decoding problem of Reed-Solomon (RS) Codes, also known as the Polynomial Reconstruction Problem (PR), from a cryptographic hardness perspective. Namely, we dea...
Aggelos Kiayias, Moti Yung
TARK
2007
Springer
15 years 4 months ago
Preservation of epistemic properties in security protocol implementations
We introduce (i) a general class of security protocols with private channel as cryptographic primitive and (ii) a probabilistic epistemic logic to express properties of security pr...
Ron van der Meyden, Thomas Wilke
DSN
2007
IEEE
15 years 4 months ago
Protecting Cryptographic Keys from Memory Disclosure Attacks
Cryptography has become an indispensable mechanism for securing systems, communications and applications. While offering strong protection, cryptography makes the assumption that ...
Keith Harrison, Shouhuai Xu
PODS
2005
ACM
119views Database» more  PODS 2005»
15 years 10 months ago
Security analysis of cryptographically controlled access to XML documents
Some promising recent schemes for XML access control employ encryption for implementing security policies on published data, avoiding data duplication. In this paper we study one ...
Bogdan Warinschi, Martín Abadi