154 search results - page 20 / 31 » Proving Group Protocols Secure Against Eavesdroppers |
EUROCRYPT
2006
Springer
15 years 1 months ago
2006
Springer
To prove that a secure key-agreement protocol exists one must at least show P = NP. Moreover any proof that the sequential composition of two non-adaptively secure pseudorandom fun...
TCC
2004
Springer
15 years 3 months ago
2004
Springer
In a paper from EuroCrypt’99, Damg˚ard, Kilian and Salvail show various positive and negative results on constructing Bit Commitment (BC) and Oblivious Transfer (OT) from Unfair...
PKC
2012
Springer
13 years 5 days ago
2012
Springer
ded abstract of this work will appear in Public Key Cryptography — PKC 2012. This is the full version. We propose a general framework that converts (ordinary) signature schemes ...
SAC
2006
ACM
15 years 3 months ago
2006
ACM
Increasingly pervasive computing throws up scenarios where users may wish to achieve some degree of security in their interaction with other people or equipment, in contexts where...
ICCSA
2007
Springer
15 years 3 months ago
2007
Springer
Deniability is defined as a privacy property which enables protocol principals to deny their involvement after they had taken part in a particular protocol run. Lately, Chou et al....