Sciweavers

199 search results - page 22 / 40
» A survey of algebraic properties used in cryptographic proto...
Sort
View
80
Voted
CCS
2006
ACM
15 years 1 months ago
Modelling the relative strength of security protocols
In this paper, we present a way to think about the relative strength of security protocols using SoS, a lattice-theoretic representation of security strength. In particular, we di...
Ho Chung, Clifford Neuman
ESORICS
2005
Springer
15 years 3 months ago
Quantifying Probabilistic Information Flow in Computational Reactive Systems
Information flow and non-interference are well-established techniques for expressing both integrity and privacy properties. Because of the enormous potential to transmit informati...
Michael Backes
EUROCRYPT
2009
Springer
15 years 10 months ago
On the Portability of Generalized Schnorr Proofs
The notion of Zero Knowledge Proofs (of knowledge) [ZKP] is central to cryptography; it provides a set of security properties that proved indispensable in concrete protocol design...
Jan Camenisch, Aggelos Kiayias, Moti Yung
73
Voted
ENTCS
2006
134views more  ENTCS 2006»
14 years 9 months ago
Anonymity in Probabilistic and Nondeterministic Systems
Anonymity means that the identity of the user performing a certain action is maintained secret. The protocols for ensuring anonymity often use random mechanisms which can be descr...
Catuscia Palamidessi
ESWS
2009
Springer
15 years 4 months ago
Middleware for Automated Implementation of Security Protocols
We propose a middleware for automated implementation of security protocols for Web services. The proposed middleware consists of two main layers: the communication layer and the se...
Béla Genge, Piroska Haller