Sciweavers

1679 search results - page 60 / 336
» Security Properties and CSP
Sort
View
CORR
2006
Springer
82views Education» more  CORR 2006»
13 years 10 months ago
Explicit Randomness is not Necessary when Modeling Probabilistic Encryption
Although good encryption functions are probabilistic, most symbolic models do not capture this aspect explicitly. A typical solution, recently used to prove the soundness of such ...
Véronique Cortier, Heinrich Hördegen, ...
IACR
2011
115views more  IACR 2011»
12 years 9 months ago
Threshold Encryption into Multiple Ciphertexts
We propose (T, N) multi-ciphertext scheme for symmetric encryption. The scheme encrypts a message into N distinct ciphertexts. The knowledge of the symmetric key allows decryption ...
Martin Stanek
JAR
2008
115views more  JAR 2008»
13 years 10 months ago
Formal Models and Analysis of Secure Multicast in Wired and Wireless Networks
The spreading of multicast technology enables the development of group communication and so dealing with digital streams becomes more and more common over the Internet. Given the f...
Roberto Gorrieri, Fabio Martinelli, Marinella Petr...
IEEEARES
2008
IEEE
14 years 4 months ago
A Critique of k-Anonymity and Some of Its Enhancements
k-Anonymity is a privacy property requiring that all combinations of key attributes in a database be repeated at least for k records. It has been shown that k-anonymity alone does...
Josep Domingo-Ferrer, Vicenç Torra
CSFW
2005
IEEE
14 years 3 months ago
An Encapsulated Authentication Logic for Reasoning about Key Distribution Protocols
Authentication and secrecy properties are proved by very different methods: the former by local reasoning, leading to matching knowledge of all principals about the order of their...
Iliano Cervesato, Catherine Meadows, Dusko Pavlovi...