Sciweavers

473 search results - page 18 / 95
» The Case for Quantum Key Distribution
Sort
View
FORTE
2003
13 years 8 months ago
A Lightweight Formal Analysis of a Multicast Key Management Scheme
Abstract. This paper describes the analysis of Pull-Based Asynchronous Rekeying Framework (ARF), a recently proposed solution to the scalable group key management problem in secure...
Mana Taghdiri, Daniel Jackson
AMC
2007
114views more  AMC 2007»
13 years 7 months ago
Software complexity: A statistical case study through insertion sort
: The present paper makes use of factorial experiments to assess software complexity using insertion sort as a trivial example. We next propose to implement the methodology in quic...
Anchala Kumari, Soubhik Chakraborty
DC
2000
13 years 7 months ago
Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study
ms, to use abstraction mappings to prove probabilistic properties, and to apply random walk theory in a distributed computational setting. We apply all of these techniques to analy...
Anna Pogosyants, Roberto Segala, Nancy A. Lynch
WISEC
2010
ACM
14 years 9 days ago
Secret keys from entangled sensor motes: implementation and analysis
Key management in wireless sensor networks does not only face typical, but also several new challenges. The scale, resource limitations, and new threats such as node capture and c...
Matthias Wilhelm, Ivan Martinovic, Jens B. Schmitt
ISITA
2010
13 years 5 months ago
Information reconciliation for QKD with rate-compatible non-binary LDPC codes
We study information reconciliation (IR) scheme for the quantum key distribution (QKD) protocols. The IR for the QKD can be considered as the asymmetric Slepian-Wolf problem, which...
Kenta Kasai, Ryutaroh Matsumoto, Kohichi Sakaniwa