Sciweavers

1679 search results - page 110 / 336
» Security Properties and CSP
Sort
View
TCC
2004
Springer
173views Cryptology» more  TCC 2004»
14 years 3 months ago
Soundness of Formal Encryption in the Presence of Active Adversaries
Abstract. We present a general method to prove security properties of cryptographic protocols against active adversaries, when the messages exchanged by the honest parties are arbi...
Daniele Micciancio, Bogdan Warinschi
PG
2003
IEEE
14 years 3 months ago
Illustration Watermarks for Vector Graphics
Digital watermarking is a technique for embedding information into data, such as images, 3D models, or audio files, such that some properties (i. e., security, imperceptibility, ...
Henry Sonnet, Tobias Isenberg, Jana Dittmann, Thom...
CSFW
2002
IEEE
14 years 3 months ago
Polynomial Fairness and Liveness
Important properties of many protocols are liveness or availability, i.e., that something good happens now and then. In asynchronous scenarios these properties obviously depend on...
Michael Backes, Birgit Pfitzmann, Michael Steiner,...
ENTCS
2007
129views more  ENTCS 2007»
13 years 10 months ago
Protocol Composition Logic (PCL)
Protocol Composition Logic (PCL) is a logic for proving security properties of network protocols that use public and symmetric key cryptography. The logic is designed around a pro...
Anupam Datta, Ante Derek, John C. Mitchell, Arnab ...
WISTP
2009
Springer
14 years 5 months ago
Algebraic Attacks on RFID Protocols
Abstract. This work aims to identify the algebraic problems which enable many attacks on RFID protocols. Toward this goal, three emerging types of attacks on RFID protocols, concer...
Ton van Deursen, Sasa Radomirovic