127 search results - page 25 / 26 » Proving Properties of Security Protocols by Induction |
103
click to vote
ASIACRYPT
2011
Springer
13 years 9 months ago
2011
Springer
The assumption of the availability of tamper-proof hardware tokens has been used extensively in the design of cryptographic primitives. For example, Katz (Eurocrypt 2007) suggests ...
87
Voted
TCC
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. In this paper we consider commitment schemes that are secure against concurrent man-in-the-middle (cMiM) attacks. Under such attacks, two possible notions of security for...
TACAS
2010
Springer
14 years 7 months ago
2010
Springer
Systems and protocols combining concurrency and infinite state space occur quite often in practice, but are very difficult to verify automatically. At the same time, if the system ...
CCS
2001
ACM
15 years 2 months ago
2001
ACM
Automated trust negotiation is an approach to establishing trust between strangers through the exchange of digital credentials and the use of access control policies that specify ...
82
Voted
TCC
2009
Springer
15 years 10 months ago
2009
Springer
Proofs of Retrievability (PoR), introduced by Juels and Kaliski [JK07], allow the client to store a file F on an untrusted server, and later run an efficient audit protocol in whi...