Alice and Bob in Love: Cryptographic Communication Using Natural Entropy (draft version)

نویسنده

  • Joseph Bonneau
چکیده

We propose a protocol for secure communication between two parties who know each other well using only the entropy from their shared life experience. This could enable, for example, lovers or close friends to communicate over a one-way channel without prior key exchange. Our system uses a flexible secret-sharing mechanism to accommodate pieces of personal knowledge of variable entropy and memorability, while still providing reasonable overhead and a high security level.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Alice and Bob in Love: Cryptographic Communication Using Natural Entropy

We propose a protocol for secure communication between two parties who know each other well using only the entropy from their shared life experience. This could enable, for example, lovers or close friends to communicate over a one-way channel without prior key exchange. Our system uses a flexible secret-sharing mechanism to accommodate pieces of personal knowledge of variable entropy and memor...

متن کامل

Towards an information-theoretically safe cryptographic protocol

We introduce what –if some kind of group action exists– is a truly (information-theoretically) safe cryptographic communication system: a protocol which provides zero information to any passive adversary having full access to the channel. 1. The false algorithm, simple version Assume Alice wants to share a secret s, which we assume for simplicity is a non-zero rational number s = p/q ∈ Q⋆. For ...

متن کامل

A new operational interpretation of relative entropy and trace distance between quantum states

In this paper we present a new operational interpretation of relative-entropy between quantum states in the form of the following protocol. P: Alice gets to know the eigen-decomposition of a quantum state ρ. Bob gets to know the eigen-decomposition of a quantum state σ. Both Alice and Bob know S (ρ‖σ) def = Trρ log ρ − ρ log σ, the relative entropy between ρ and σ and an error parameter ε. Alic...

متن کامل

Comp760, Summary of Lecture 14

So far, in this course, we have been focused on the communication cost of protocols, and given various communication tasks, we studied the minimum communication cost required to perform those tasks. The information theoretic tools introduced in the past two lectures enable us to introduce another natural measure of complexity. Roughly speaking, given a protocol and a distribution on the inputs ...

متن کامل

Protocols for Secure Remote Database Access with Approximate Matching

Suppose that Bob has a database D and that Alice wants to perform a search query q on D (e.g., “is q in D?”). Since Alice is concerned about her privacy, she does not want Bob to know the query q or the response to the query. How could this be done? There are elegant cryptographic techniques for solving this problem under various constraints (such as “Bob should know neither q nor the answer to...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009