34 search results - page 3 / 7 » A Practical Attack on a Braid Group Based Cryptographic Prot... |
IFIP
2009
Springer
13 years 5 months ago
2009
Springer
Cryptographic protocols can only be secure under certain inequality assumptions. Axiomatizing these inequalities explicitly is problematic: stating too many inequalities may impair...
TCC
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We prove a computational soundness theorem for the symbolic analysis of cryptographic protocols which extends an analogous theorem of Abadi and Rogaway (J. of Cryptology ...
IEEEARES
2007
IEEE
14 years 2 months ago
2007
IEEE
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...
CANS
2006
Springer
13 years 11 months ago
2006
Springer
Pairings on elliptic curves have been used as cryptographic primitives for the development of new applications such as identity based schemes. For the practical applications, it is...
EUROCRYPT
2008
Springer
13 years 9 months ago
2008
Springer
Non-interactive zero-knowledge proofs and non-interactive witness-indistinguishable proofs have played a significant role in the theory of cryptography. However, lack of efficienc...