Sciweavers

53 search results - page 7 / 11
» Minimal Complete Primitives for Secure Multi-party Computati...
Sort
View
CCS
2009
ACM
14 years 2 months ago
On non-cooperative location privacy: a game-theoretic analysis
In mobile networks, authentication is a required primitive of the majority of security protocols. However, an adversary can track the location of mobile nodes by monitoring pseudo...
Julien Freudiger, Mohammad Hossein Manshaei, Jean-...
SACMAT
2006
ACM
14 years 1 months ago
Constraint generation for separation of duty
Separation of Duty (SoD) is widely recognized to be a fundamental principle in computer security. A Static SoD (SSoD) policy states that in order to have all permissions necessary...
Hong Chen, Ninghui Li
ACMICEC
2004
ACM
148views ECommerce» more  ACMICEC 2004»
14 years 24 days ago
A secure and private clarke tax voting protocol without trusted authorities
Electronic voting has become one of the most popular activities over the Internet. Security and privacy are always regarded as crucial factors in electronic voting system design. ...
Changjie Wang, Ho-fung Leung
CRYPTO
2004
Springer
119views Cryptology» more  CRYPTO 2004»
14 years 23 days ago
Security of Random Feistel Schemes with 5 or More Rounds
We study cryptographic attacks on random Feistel schemes. We denote by m the number of plaintext/ciphertext pairs, and by k the number of rounds. In their famous paper [3], M. Luby...
Jacques Patarin
EUROCRYPT
2003
Springer
14 years 17 days ago
A Theoretical Treatment of Related-Key Attacks: RKA-PRPs, RKA-PRFs, and Applications
ded abstract of this paper appears in Advances in Cryptology – EUROCRYPT ’03, Lecture Notes in Computer Science Vol. 2656, E. Biham ed., Springer-Verlag, 2003. This is the full...
Mihir Bellare, Tadayoshi Kohno