Sciweavers

26 search results - page 5 / 6
» Equational Cryptographic Reasoning in the Maude-NRL Protocol...
Sort
View
ECCC
2007
144views more  ECCC 2007»
13 years 7 months ago
Algebraic Lower Bounds for Computing on Encrypted Data
In cryptography, there has been tremendous success in building primitives out of homomorphic semantically-secure encryption schemes, using homomorphic properties in a blackbox way...
Rafail Ostrovsky, William E. Skeith III
CADE
2008
Springer
14 years 7 months ago
Certifying a Tree Automata Completion Checker
Tree automata completion is a technique for the verification of infinite state systems. It has already been used for the verification of cryptographic protocols and the prototyping...
Benoît Boyer, Thomas Genet, Thomas P. Jensen
JNSM
2010
110views more  JNSM 2010»
13 years 2 months ago
Distributed Automatic Configuration of Complex IPsec-Infrastructures
The Internet Protocol Security Architecture IPsec is hard to deploy in large, nested, or dynamic scenarios. The major reason for this is the need for manual configuration of the cr...
Michael Rossberg, Guenter Schaefer, Thorsten Struf...
POPL
2001
ACM
14 years 7 months ago
Mobile values, new names, and secure communication
We study the interaction of the "new" construct with a rich but common form of (first-order) communication. This interaction is crucial in security protocols, which are ...
Cédric Fournet, Martín Abadi
TII
2008
132views more  TII 2008»
13 years 7 months ago
Credential Management for Automatic Identification Solutions in Supply Chain Management
Current systems for automatic identification of goods presume a single administrative domain. However, in supply chain management systems temporary cooperations of multiple compani...
Marcel Henseler, Michael Rossberg, Guenter Schaefe...