Sciweavers

743 search results - page 70 / 149
» Secure Signature Schemes based on Interactive Protocols
Sort
View
EUROCRYPT
2007
Springer
14 years 1 months ago
Simulatable Adaptive Oblivious Transfer
We study an adaptive variant of oblivious transfer in which a sender has N messages, of which a receiver can adaptively choose to receive k one-after-the-other, in such a way that ...
Jan Camenisch, Gregory Neven, Abhi Shelat
DEXAW
2006
IEEE
188views Database» more  DEXAW 2006»
14 years 1 months ago
A Protocol for Secure Content Distribution in Pure P2P Networks
A significant challenge for Peer-to-Peer (P2P) systems is maintaining the correctness and consistency of their global data structures and shared contents as peers independently a...
Esther Palomar, Juan M. Estévez-Tapiador, J...
SCN
2004
Springer
123views Communications» more  SCN 2004»
14 years 1 months ago
On the Key Exposure Problem in Chameleon Hashes
Chameleon signatures were introduced by Krawczyk and Rabin, being non-interactive signature schemes that provide non-transferability. However, that first construction employs a c...
Giuseppe Ateniese, Breno de Medeiros
CSFW
2010
IEEE
13 years 11 months ago
Strong Invariants for the Efficient Construction of Machine-Checked Protocol Security Proofs
We embed an operational semantics for security protocols in the interactive theorem prover Isabelle/HOL and derive two strong protocol-independent invariants. These invariants allo...
Simon Meier, Cas J. F. Cremers, David A. Basin
ADHOCNOW
2010
Springer
13 years 9 months ago
Data Aggregation Integrity Based on Homomorphic Primitives in Sensor Networks
Designing message integrity schemes for data aggregation is an imperative problem for securing wireless sensor networks. In this paper, we propose three secure aggregation schemes ...
Zhijun Li, Guang Gong