Sciweavers

659 search results - page 42 / 132
» Compiling and securing cryptographic protocols
Sort
View
RTA
2009
Springer
15 years 7 months ago
Protocol Security and Algebraic Properties: Decision Results for a Bounded Number of Sessions
Abstract. We consider the problem of deciding the security of cryptographic protocols for a bounded number of sessions, taking into account some algebraic properties of the securit...
Sergiu Bursuc, Hubert Comon-Lundh
CRYPTO
2003
Springer
96views Cryptology» more  CRYPTO 2003»
15 years 5 months ago
Scalable Protocols for Authenticated Group Key Exchange
We consider the fundamental problem of authenticated group key exchange among n parties within a larger and insecure public network. A number of solutions to this problem have bee...
Jonathan Katz, Moti Yung
102
Voted
SECPERU
2006
IEEE
15 years 6 months ago
Using One-Way Chains to Provide Message Authentication without Shared Secrets
The objective of this paper is to propose a cryptographic protocol which provides authenticity in the exchange of information between two entities without using any shared secret ...
Bogdan Groza
95
Voted
IPL
2006
118views more  IPL 2006»
15 years 13 days ago
Easy intruder deduction problems with homomorphisms
We present complexity results for the verification of security protocols. Since the perfect cryptography assumption is unrealistic for cryptographic primitives with visible algebr...
Stéphanie Delaune
109
Voted
IEEEARES
2007
IEEE
15 years 6 months ago
Agent Alliances: A Means for Practical Threshold Signature
In [7] we have proposed a model for the robust and private evaluation of a function within a group of cooperating mobile agents, called an agent Alliance. The model has been given...
Regine Endsuleit, Christoph Amma