719 search results - page 11 / 144 » Proving Security Protocols Correct |
EUROCRYPT
1999
Springer
15 years 1 months ago
1999
Springer
Abstract. We present the first efficient statistical zero-knowledge protocols to prove statements such as: – A committed number is a prime. – A committed (or revealed) number ...
ACISP
2005
Springer
15 years 3 months ago
2005
Springer
We present a provably secure tree based authenticated group key agreement protocol in dynamic scenario. Bilinear pairing and multi-signature are at the heart of our protocol. We p...
TCC
2004
Springer
15 years 2 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...
ACISP
2007
Springer
15 years 1 months ago
2007
Springer
In this note, we describe a correction to the cryptosystem proposed in [1, 2]. Although the correction is small and does not affect the performance of the protocols from [1, 2], it...
ASIAN
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. This paper is concerned about relating formal and computational models of cryptography in case of active adversaries when formal security analysis is done with first ord...