Sciweavers

165 search results - page 14 / 33
» Safely Composing Security Protocols
Sort
View
CSFW
2010
IEEE
15 years 1 months ago
A Machine-Checked Formalization of Sigma-Protocols
—Zero-knowledge proofs have a vast applicability in the domain of cryptography, stemming from the fact that they can be used to force potentially malicious parties to abide by th...
Gilles Barthe, Daniel Hedin, Santiago Zanella B&ea...
SPW
2004
Springer
15 years 3 months ago
The Dancing Bear: A New Way of Composing Ciphers
This note presents a new way of composing cryptographic primitives which makes some novel combinations possible. For example, one can do threshold decryption using standard block c...
Ross Anderson
APSCC
2007
IEEE
15 years 4 months ago
ID-Based Key Agreement for Dynamic Peer Groups in Mobile Computing Environments
In order to secure communications for dynamic peer groups in mobile computing environments, key agreement protocols are required. In this paper, we propose a new key agreement pro...
Raylin Tso, Xun Yi, Eiji Okamoto
JUCS
2006
86views more  JUCS 2006»
14 years 9 months ago
Secure Service Discovery based on Trust Management for ad-hoc Networks
Abstract: In ad-hoc networks, mobile devices communicate via wireless links without the aid of any fixed networking infrastructure. These devices must be able to discover services ...
Celeste Campo, Florina Almenárez Mendoza, D...
EUROCRYPT
2010
Springer
15 years 2 months ago
Adaptively Secure Broadcast
A broadcast protocol allows a sender to distribute a message through a point-to-point network to a set of parties, such that (i) all parties receive the same message, even if the s...
Martin Hirt, Vassilis Zikas