Trade-Offs in Information-Theoretic Multi-party One-Way Key Agreement (Englisch)

In: Information Theoretic Security ,  3 ;  65-75 ;  2009

Wie erhalte ich diesen Titel?

Download
Kommerziell Vergütung an den Verlag: 24,95 € Grundgebühr: 4,00 € Gesamtpreis: 28,95 €
Akademisch Vergütung an den Verlag: 12,50 € Grundgebühr: 2,00 € Gesamtpreis: 14,50 €

Abstract

We consider the following scenario involving three honest parties, Alice, Bob, and Carol, as well as an adversary, Eve. Each party has access to a single piece of information, jointly distributed according to some distribution P. Additionally, authentic public communication is possible from Alice to Carol and from Bob to Carol. Their goal is to establish two information-theoretically secret keys, one known to Alice and Carol, and one known to Bob and Carol. We derive joint bounds on the lengths of these keys. Our protocols combine distributed variants of Slepian-Wolf coding and the leftover hash lemma. The obtained bounds are expressed in terms of smooth Rényi entropies and show that these quantities are useful in this—single-serving—context as well.

Inhaltsverzeichnis E-Book

Das Inhaltsverzeichnis des E-Books wird automatisch erzeugt und basieren auf den im Index des TIB-Portals verfügbaren Nachweisen der enthaltenen Aufsätze.

1
Commitment and Authentication Systems
Pinto, Alexandre / Souto, André / Matos, Armando / Antunes, Luís | 2009
23
Unconditionally Secure Blind Signatures
Hara, Yuki / Seito, Takenobu / Shikata, Junji / Matsumoto, Tsutomu | 2009
44
Random Systems: Theory and Applications
Maurer, Ueli | 2009
46
Optimising SD and LSD in Presence of Non-uniform Probabilities of Revocation
D’Arco, Paolo / Santis, Alfredo | 2009
65
Trade-Offs in Information-Theoretic Multi-party One-Way Key Agreement
Renner, Renato / Wolf, Stefan / Wullschleger, Jürg | 2009
76
Improvement of Collusion Secure Convolutional Fingerprinting Information Codes
Tomàs-Buliart, Joan / Fernandez, Marcel / Soriano, Miguel | 2009
89
On Exponential Lower Bound for Protocols for Reliable Communication in Networks
Srinathan, K. / Rangan, C. Pandu / Kumaresan, R. | 2009
99
Almost Secure (1-Round, n-Channel) Message Transmission Scheme
Kurosawa, Kaoru / Suzuki, Kazuhiro | 2009
113
Construction Methodology of Unconditionally Secure Signature Schemes
Shikata, Junji | 2009
115
New Results on Unconditionally Secure Multi-receiver Manual Authentication
Wang, Shuhong / Safavi-Naini, Reihaneh | 2009
133
Unconditionally Secure Chaffing-and-Winnowing for Multiple Use
Kitada, Wataru / Hanaoka, Goichiro / Matsuura, Kanta / Imai, Hideki | 2009
146
Introduction to Quantum Information Theory
Kerenidis, Iordanis | 2009
148
Strongly Multiplicative Hierarchical Threshold Secret Sharing
Käsper, Emilia / Nikov, Ventzislav / Nikova, Svetla | 2009
169
Secret Sharing Comparison by Transformation and Rotation
Reistad, Tord Ingolf / Toft, Tomas | 2009
181
Anonymous Quantum Communication
Brassard, Gilles / Broadbent, Anne / Fitzsimons, Joseph / Gambs, Sébastien / Tapp, Alain | 2009
183
Efficient Oblivious Transfer Protocols Achieving a Non-zero Rate from Any Non-trivial Noisy Correlation
Imai, Hideki / Morozov, Kirill / Nascimento, Anderson C. A. | 2009
195
Cryptographic Security of Individual Instances
Antunes, L. / Laplante, S. / Pinto, A. / Salvador, L. | 2009

Ähnliche Titel