Sciweavers

2237 search results - page 243 / 448
» On the Security of Random Sources
Sort
View
TCC
2010
Springer
231views Cryptology» more  TCC 2010»
16 years 4 months ago
A Domain Extender for the Ideal Cipher
We describe the first domain extender for ideal ciphers, i.e. we show a construction that is indifferentiable from a 2n-bit ideal cipher, given a n-bit ideal cipher. Our construc...
Jean-Sébastien Coron, Yevgeniy Dodis, Avrad...
ICPADS
2008
IEEE
16 years 1 months ago
Integrity-Preserving Replica Coordination for Byzantine Fault Tolerant Systems
The use of good random numbers is essential to the integrity of many mission-critical systems. However, when such systems are replicated for Byzantine fault tolerance, a serious i...
Wenbing Zhao
WAIFI
2007
Springer
110views Mathematics» more  WAIFI 2007»
16 years 1 months ago
On Kabatianskii-Krouk-Smeets Signatures
Kabastianskii, Krouk and Smeets proposed in 1997 a digital signature scheme based on random error-correcting codes. In this paper we investigate the security and the efficiency of ...
Pierre-Louis Cayrel, Ayoub Otmani, Damien Vergnaud
FC
2005
Springer
87views Cryptology» more  FC 2005»
16 years 20 days ago
Protecting Secret Data from Insider Attacks
We consider defenses against confidentiality and integrity attacks on data following break-ins, or so-called intrusion resistant storage technologies. We investigate the problem o...
David Dagon, Wenke Lee, Richard J. Lipton
CADE
2008
Springer
16 years 7 months ago
Celf - A Logical Framework for Deductive and Concurrent Systems (System Description)
CLF (Concurrent LF) [CPWW02a] is a logical framework for specifying and implementing deductive and concurrent systems from areas, such as programming language theory, security prot...
Anders Schack-Nielsen, Carsten Schürmann