Sciweavers

719 search results - page 26 / 144
» Proving Security Protocols Correct
Sort
View
EUROCRYPT
2008
Springer
14 years 11 months ago
Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle
A shuffle of a set of ciphertexts is a new set of ciphertexts with the same plaintexts in permuted order. Shuffles of homomorphic encryptions are a key component in mix-nets, whic...
Jens Groth, Yuval Ishai
NDSS
2000
IEEE
15 years 2 months ago
A First Step Towards the Automatic Generation of Security Protocols
This paper describes automatic protocol generation (APG for short), a novel mechanism to generate security protocols automatically. With APG, the protocol designer inputs the spec...
Adrian Perrig, Dawn Xiaodong Song
CTRSA
2011
Springer
189views Cryptology» more  CTRSA 2011»
14 years 1 months ago
Ideal Key Derivation and Encryption in Simulation-Based Security
Abstract. Many real-world protocols, such as SSL/TLS, SSH, IPsec, IEEE 802.11i, DNSSEC, and Kerberos, derive new keys from other keys. To be able to analyze such protocols in a com...
Ralf Küsters, Max Tuengerthal
81
Voted
IWSEC
2007
Springer
15 years 3 months ago
A Secure Threshold Anonymous Password-Authenticated Key Exchange Protocol
At Indocrypt 2005, Viet et al., [22] have proposed an anonymous password-authenticated key exchange (PAKE) protocol and its threshold construction both of which are designed for cl...
SeongHan Shin, Kazukuni Kobara, Hideki Imai
EUROCRYPT
2004
Springer
15 years 3 months ago
On Generating the Initial Key in the Bounded-Storage Model
Abstract. In the bounded-storage model (BSM) for information-theoretically secure encryption and key-agreement one uses a random string R whose length t is greater than the assumed...
Stefan Dziembowski, Ueli M. Maurer