Sciweavers

743 search results - page 47 / 149
» Secure Signature Schemes based on Interactive Protocols
Sort
View
CRYPTO
2010
Springer
158views Cryptology» more  CRYPTO 2010»
13 years 10 months ago
Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography
Motivated by the question of basing cryptographic protocols on stateless tamper-proof hardware tokens, we revisit the question of unconditional two-prover zero-knowledge proofs fo...
Vipul Goyal, Yuval Ishai, Mohammad Mahmoody, Amit ...
PET
2004
Springer
14 years 2 months ago
Reputable Mix Networks
We define a new type of mix network that offers a reduced form of robustness: the mixnet can prove that every message it outputs corresponds to an input submitted by a player wit...
Philippe Golle
ICICS
2005
Springer
14 years 2 months ago
Security Properties of Two Authenticated Conference Key Agreement Protocols
In this paper we analyse the security of two authenticated group key agreement schemes based on the group key agreement protocol of Burmester and Desmedt. One scheme was proposed ...
Qiang Tang, Chris J. Mitchell
WIMOB
2008
IEEE
14 years 3 months ago
Securing Dynamic Home Agent Address Discovery with Cryptographically Generated Addresses and RSA Signatures
With Dynamic Home Agent Address Discovery (DHAAD), as specified in Mobile IPv6, a Mobile Node can discover the address of a suitable Home Agent on the home link. However, DHAAD suf...
Christian Bauer, Max Ehammer
SCN
2010
Springer
147views Communications» more  SCN 2010»
13 years 7 months ago
Group Message Authentication
Group signatures is a powerful primitive with many practical applications, allowing a group of parties to share a signature functionality, while protecting the anonymity of the si...
Bartosz Przydatek, Douglas Wikström