Sciweavers

243 search results - page 43 / 49
» LDYIS: a Framework for Model Checking Security Protocols
Sort
View
CONCUR
2007
Springer
14 years 2 months ago
Making Random Choices Invisible to the Scheduler
Abstract. When dealing with process calculi and automata which express both nondeterministic and probabilistic behavior, it is customary to introduce the notion of scheduler to res...
Konstantinos Chatzikokolakis, Catuscia Palamidessi
USITS
1997
13 years 9 months ago
Lightweight Security Primitives for E-Commerce
Emerging applications in electronic commerce often involve very low-cost transactions, which execute in the context of ongoing, extended clientserver relationships. For example, c...
Yossi Matias, Alain J. Mayer, Abraham Silberschatz
FC
2010
Springer
169views Cryptology» more  FC 2010»
13 years 11 months ago
A Formal Approach for Automated Reasoning about Off-Line and Undetectable On-Line Guessing
Abstract. Starting from algebraic properties that enable guessing lowentropy secrets, we formalize guessing rules for symbolic verification. The rules are suited for both off-line ...
Bogdan Groza, Marius Minea
IACR
2011
196views more  IACR 2011»
12 years 8 months ago
Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
Fully homomorphic encryption (FHE) provides a simple template for secure computation between two parties (Alice and Bob) where: (I) Alice encrypts her input under her key, (II) Bo...
Gilad Asharov, Abhishek Jain, Daniel Wichs
AMW
2010
13 years 10 months ago
Certification and Authentication of Data Structures
We study query authentication schemes, algorithmic and cryptographic constructions that provide efficient and secure protocols for verifying the results of queries over structured...
Roberto Tamassia, Nikos Triandopoulos