Sciweavers

504 search results - page 82 / 101
» Complexity Properties of Restricted Abstract Argument System...
Sort
View
CCS
2008
ACM
13 years 9 months ago
Efficient attributes for anonymous credentials
We extend the Camenisch-Lysyanskaya anonymous credential system such that selective disclosure of attributes becomes highly efficient. The resulting system significantly improves ...
Jan Camenisch, Thomas Groß
TPHOL
2008
IEEE
14 years 2 months ago
The Isabelle Framework
g to the well-known “LCF approach” of secure inferences as abstract datatype constructors in ML [16]; explicit proof terms are also available [8]. Isabelle/Isar provides sophis...
Makarius Wenzel, Lawrence C. Paulson, Tobias Nipko...
CRYPTO
2000
Springer
134views Cryptology» more  CRYPTO 2000»
14 years 5 hour ago
Taming the Adversary
Abstract. While there is a great deal of sophistication in modern cryptology, simple (and simplistic) explanations of cryptography remain useful and perhaps necessary. Many of the ...
Martín Abadi
APAQS
2001
IEEE
13 years 11 months ago
Incremental Fault-Tolerant Design in an Object-Oriented Setting
With the increasing emphasis on dependability in complex, distributed systems, it is essential that system development can be done gradually and at different levels of detail. In ...
Einar Broch Johnsen, Olaf Owe, Ellen Munthe-Kaas, ...
TSP
2008
92views more  TSP 2008»
13 years 7 months ago
Distributed Structures, Sequential Optimization, and Quantization for Detection
Abstract--In the design of distributed quantization systems one inevitably confronts two types of constraints--those imposed by a distributed system's structure and those impo...
Michael A. Lexa, Don H. Johnson