Sciweavers

691 search results - page 87 / 139
» A New Security Model for Authenticated Key Agreement
Sort
View
IACR
2011
80views more  IACR 2011»
14 years 1 months ago
History-Free Sequential Aggregate Signatures
Aggregation schemes allow to combine several cryptographic values like message authentication codes or signatures into a shorter value such that, despite compression, some notion o...
Marc Fischlin, Anja Lehmann, Dominique Schröd...
126
Voted
CORR
2010
Springer
110views Education» more  CORR 2010»
15 years 1 months ago
(Unconditional) Secure Multiparty Computation with Man-in-the-middle Attacks
In secure multi-party computation n parties jointly evaluate an n-variate function f in the presence of an adversary which can corrupt up till t parties. All honest parties are req...
Shailesh Vaya
SP
2006
IEEE
147views Security Privacy» more  SP 2006»
15 years 7 months ago
A Computationally Sound Mechanized Prover for Security Protocols
We present a new mechanized prover for secrecy properties of security protocols. In contrast to most previous provers, our tool does not rely on the Dolev-Yao model, but on the co...
Bruno Blanchet
ACSAC
2002
IEEE
15 years 6 months ago
Networking in The Solar Trust Model: Determining Optimal Trust Paths in a Decentralized Trust Network
The Solar Trust Model provides a method by which the sender of a message can be authenticated, and the level of trust that can be placed in the sender of the message or the messag...
Michael Clifford
TIT
2010
130views Education» more  TIT 2010»
14 years 8 months ago
Pseudo-random functions and parallelizable modes of operations of a block cipher
This paper considers the construction and analysis of pseudo-random functions (PRFs) with specific reference to modes of operations of a block cipher. In the context of message aut...
Palash Sarkar