Sciweavers

370 search results - page 70 / 74
» Limits of Constructive Security Proofs
Sort
View
OOPSLA
2005
Springer
14 years 1 months ago
Javari: adding reference immutability to Java
This paper describes a type system that is capable of expressing and enforcing immutability constraints. The speonstraint expressed is that the abstract state of the object to whi...
Matthew S. Tschantz, Michael D. Ernst
IM
1997
13 years 9 months ago
Switchlets and Dynamic Virtual ATM Networks
This paper presents a novel approach to the control and management of ATM networks, by allowing di erent control architectures to be operational within the same network, and on th...
Jacobus E. van der Merwe, Ian M. Leslie
PKC
2011
Springer
185views Cryptology» more  PKC 2011»
12 years 11 months ago
Signatures on Randomizable Ciphertexts
xtended abstract which appears in the 2011 International Conference on Theory and Practice in Public Key Cryptography PKC 2011 (6–9 march 2011, Taormina, Italy) D. Catalano, N. F...
Olivier Blazy, Georg Fuchsbauer, David Pointcheval...
STOC
2001
ACM
163views Algorithms» more  STOC 2001»
14 years 8 months ago
Extractor codes
We study error-correcting codes for highly noisy channels. For example, every received signal in the channel may originate from some half of the symbols in the alphabet. Our main c...
Amnon Ta-Shma, David Zuckerman
COCO
2009
Springer
115views Algorithms» more  COCO 2009»
14 years 2 months ago
Locally Testable Codes Require Redundant Testers
Locally testable codes (LTCs) are error-correcting codes for which membership, in the code, of a given word can be tested by examining it in very few locations. Most known constru...
Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman...