Sciweavers

3384 search results - page 439 / 677
» More Testable Properties
Sort
View
RTA
2005
Springer
16 years 3 days ago
Intruder Deduction for AC-Like Equational Theories with Homomorphisms
Cryptographic protocols are small programs which involve a high level of concurrency and which are difficult to analyze by hand. The most successful methods to verify such protocol...
Pascal Lafourcade, Denis Lugiez, Ralf Treinen
SAT
2005
Springer
142views Hardware» more  SAT 2005»
16 years 3 days ago
Optimizations for Compiling Declarative Models into Boolean Formulas
Advances in SAT solver technology have enabled many automated analysis and reasoning tools to reduce their input problem to a SAT problem, and then to use an efficient SAT solver ...
Darko Marinov, Sarfraz Khurshid, Suhabe Bugrara, L...
TARK
2005
Springer
16 years 2 days ago
Unconditional privacy in social choice
The aggregation of conflicting preferences is an important issue in human society and multiagent systems. Due to its universality, voting among a set of alternatives has a centra...
Felix Brandt, Tuomas Sandholm
TCC
2005
Springer
169views Cryptology» more  TCC 2005»
16 years 2 days ago
Chosen-Ciphertext Security of Multiple Encryption
Encryption of data using multiple, independent encryption schemes (“multiple encryption”) has been suggested in a variety of contexts, and can be used, for example, to protect ...
Yevgeniy Dodis, Jonathan Katz
TGC
2005
Springer
16 years 2 days ago
A General Name Binding Mechanism
We study fusion and binding mechanisms in name passing process calculi. To this purpose, we introduce the U-Calculus, a process calculus with no I/O polarities and a unique form of...
Michele Boreale, Maria Grazia Buscemi, Ugo Montana...