Sciweavers

154 search results - page 27 / 31
» Proving Group Protocols Secure Against Eavesdroppers
Sort
View
TCC
2004
Springer
173views Cryptology» more  TCC 2004»
15 years 3 months ago
Soundness of Formal Encryption in the Presence of Active Adversaries
Abstract. We present a general method to prove security properties of cryptographic protocols against active adversaries, when the messages exchanged by the honest parties are arbi...
Daniele Micciancio, Bogdan Warinschi
JOC
2000
181views more  JOC 2000»
14 years 9 months ago
Security Arguments for Digital Signatures and Blind Signatures
Abstract. Since the appearance of public-key cryptography in the seminal DiffieHellman paper, many new schemes have been proposed and many have been broken. Thus, the simple fact t...
David Pointcheval, Jacques Stern
JSAC
2006
155views more  JSAC 2006»
14 years 9 months ago
LR-AKE-Based AAA for Network Mobility (NEMO) Over Wireless Links
Network mobility introduces far more complexity than host mobility. Therefore, host mobility protocols such as Mobile IPv6 (MIPv6) need to be extended to support this new type of m...
Hanane Fathi, SeongHan Shin, Kazukuni Kobara, Shya...
CRYPTO
2005
Springer
171views Cryptology» more  CRYPTO 2005»
15 years 3 months ago
On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes
Error correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, we study the connections between codes, matroids, and a s...
Ronald Cramer, Vanesa Daza, Ignacio Gracia, Jorge ...
ADHOC
2006
155views more  ADHOC 2006»
14 years 9 months ago
Application versus network layer multicasting in ad hoc networks: the ALMA routing protocol
Application layer multicasting has emerged as an appealing alternative to network layer multicasting in wireline networks. Here, we examine the suitability of application layer mu...
Min Ge, Srikanth V. Krishnamurthy, Michalis Falout...