105 search results - page 12 / 21 » Simple, Black-Box Constructions of Adaptively Secure Protoco... |
ASIACRYPT
2004
Springer
15 years 3 months ago
2004
Springer
We consider the problem of securely computing the Greater Than (GT) predicate and its generalization – securely determining membership in a union of intervals. We approach these ...
206
click to vote
INFOCOM
2012
IEEE
13 years 8 months ago
2012
IEEE
We derive bounds on the expected loss for authentication protocols in channels which are constrained due to noisy
conditions and communication costs. This is motivated by a
numbe...
CSFW
2004
IEEE
15 years 1 months ago
2004
IEEE
Recently we showed how to justify a Dolev-Yao type model of cryptography as used in virtually all automated protocol provers under active attacks and in arbitrary protocol environ...
99
Voted
ACMICEC
2003
ACM
15 years 2 months ago
2003
ACM
A multi-agent marketplace, MAGNET (Multi AGent Negotiation Testbed), is a promising solution to conduct online combinatorial auctions. The trust model of MAGNET is somewhat diffe...
SCN
2010
Springer
14 years 8 months ago
2010
Springer
In this work, we consider Authentication and Key Agreement (AKA), a popular client-server Key Exchange (KE) protocol, commonly used in wireless standards (e.g., UMTS), and widely c...