Sciweavers

403 search results - page 27 / 81
» An algebra for commitment protocols
Sort
View
CLIMA
2004
15 years 1 months ago
A Computational Model for Conversation Policies for Agent Communication
In this paper we propose a formal specification of a persuasion protocol between autonomous agents using an approach based on social commitments and arguments. In order to be flexi...
Jamal Bentahar, Bernard Moulin, John-Jules Ch. Mey...
CRYPTO
2008
Springer
165views Cryptology» more  CRYPTO 2008»
15 years 1 months ago
Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries
In this work we study the design of secure protocols for linear algebra problems. All current solutions to the problem are either inefficient in terms of communication complexity o...
Payman Mohassel, Enav Weinreb
ECCC
2007
144views more  ECCC 2007»
14 years 11 months ago
Algebraic Lower Bounds for Computing on Encrypted Data
In cryptography, there has been tremendous success in building primitives out of homomorphic semantically-secure encryption schemes, using homomorphic properties in a blackbox way...
Rafail Ostrovsky, William E. Skeith III
FCT
2003
Springer
15 years 5 months ago
Context-Sensitive Equivalences for Non-interference Based Protocol Analysis
We develop new proof techniques, based on non-interference, for the analysis of safety and liveness properties of cryptographic protocols expressed as terms of the process algebra ...
Michele Bugliesi, Ambra Ceccato, Sabina Rossi
NCA
2008
IEEE
15 years 6 months ago
On the Application of Formal Methods for Specifying and Verifying Distributed Protocols
In this paper we consider the frameworks of Process Algebra and I/O Automata and we apply both towards the verification of a distributed leader-election protocol. Based on the tw...
Marina Gelastou, Chryssis Georgiou, Anna Philippou