Sciweavers

1970 search results - page 256 / 394
» Security Without Firewalls
Sort
View
137
Voted
CRYPTO
2006
Springer
112views Cryptology» more  CRYPTO 2006»
15 years 7 months ago
On Expected Constant-Round Protocols for Byzantine Agreement
In a seminal paper, Feldman and Micali (STOC '88) show an n-party Byzantine agreement protocol tolerating t < n/3 malicious parties that runs in expected constant rounds. H...
Jonathan Katz, Chiu-Yuen Koo
FDTC
2006
Springer
102views Cryptology» more  FDTC 2006»
15 years 7 months ago
Cryptographic Key Reliable Lifetimes: Bounding the Risk of Key Exposure in the Presence of Faults
With physical attacks threatening the security of current cryptographic schemes, no security policy can be developed without taking into account the physical nature of computation....
Alfonso De Gregorio
130
Voted
CCS
2000
ACM
15 years 7 months ago
Accountable certificate management using undeniable attestations
This paper initiates a study of accountable certificate management methods, necessary to support long-term authenticity of digital documents. Our main contribution is a model for ...
Ahto Buldas, Peeter Laud, Helger Lipmaa
155
Voted
FC
2000
Springer
150views Cryptology» more  FC 2000»
15 years 7 months ago
Self-Scrambling Anonymizers
For the two last decades, people have tried to provide practical electronic cash schemes, with more or less success. Indeed, the most secure ones generally suffer from inefficiency...
David Pointcheval
SP
1991
IEEE
15 years 7 months ago
A Novel Decomposition of Multilevel Relations into Single-Level Relations
In this paper we give a new decomposition algorithm that breaks a multilevel relation into single-level relations and a new recovery algorithmwhich reconstructs the original multi...
Sushil Jajodia, Ravi S. Sandhu