Sciweavers

1597 search results - page 184 / 320
» Mental Models of Computer Security
Sort
View
ASIACRYPT
2004
Springer
15 years 10 months ago
Generic Homomorphic Undeniable Signatures
We introduce a new computational problem related to the interpolation of group homomorphisms which generalizes many famous cryptographic problems including discrete logarithm, Diļ¬...
Jean Monnerat, Serge Vaudenay
CCS
1993
ACM
15 years 8 months ago
Why Cryptosystems Fail
Designers of cryptographic systems are at a disadvantage to most other engineers, in that information on how their systems fail is hard to get: their major users have traditionall...
Ross J. Anderson
PKC
2004
Springer
112views Cryptology» more  PKC 2004»
15 years 10 months ago
Identity-Based Threshold Decryption
Abstract. In this paper, we examine issues related to the construction of identity-based threshold decryption schemes and argue that it is important in practice to design an identi...
Joonsang Baek, Yuliang Zheng
ASIAN
2006
Springer
133views Algorithms» more  ASIAN 2006»
15 years 8 months ago
Normal Proofs in Intruder Theories
Given an arbitrary intruder deduction capability, modeled as an inference system S and a protocol, we show how to compute an inference system bS such that the security problem for ...
Vincent Bernat, Hubert Comon-Lundh
152
Voted
COMGEO
2010
ACM
15 years 8 months ago
Access control systems for spatial data infrastructures and their administration
Today sophisticated concepts, languages and frameworks exist, that allow implementing powerful fine grained access control systems for protecting Web Services and spatial data in ...
Jan Herrmann