NDLI: New bounds on the information-theoretic key agreement of multiple terminals

Content Provider	IEEE Xplore Digital Library
Author	Gohari, A.A. Anantharam, V.
Copyright Year	2008
Description	Author affiliation: EECS Dept., Univ. of California Berkeley, Berkeley, CA (Gohari, A.A.; Anantharam, V.)
Abstract	We study the problem of information-theoretically secure secret key agreement under the well-known source model and channel model. In both of these models the parties wish to create a shared secret key that is secure from an eavesdropper with unlimited computational resources. In the channel model, the first party can choose a sequence of inputs to a discrete memoryless channel, which has outputs at the other parties and at the eavesdropper. After each channel use, the parties can engage in arbitrarily many rounds of interactive authenticated communication over a public channel. At the end, each party should be able to generate the key. In the source model, the parties wishing to generate a secret key (as well as the eavesdropper) receive a certain number of independent identically distributed copies of jointly distributed random variables after which the parties are allowed interactive authenticated public communication, at the end of which each party should be able to generate the key. We derive new lower and upper bounds on the secret key rate under the source model and the channel model, and introduce a technique for proving that a given expression bounds the secrecy rate from above in the channel model. Our lower bounds strictly improve what is essentially the best known lower bound in both the source model and the channel model. Our upper bound in the channel model strictly improves the current state of art upper bound. We do not know whether our new upper bound in the source model represents an strict improvement but it includes the current best known bound as a special case.
Starting Page	742
Ending Page	746
File Size	263411
Page Count	5
File Format	PDF
ISBN	9781424422562
DOI	10.1109/ISIT.2008.4595085
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2008-07-06
Publisher Place	Canada
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Random variables Upper bound Computational modeling Joints Mathematical model Protocols Gain
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

New bounds on the information-theoretic key agreement of multiple terminals.

Communication for omniscience by a neutral observer and information-theoretic key agreement of multiple terminals (2007)

New bounds on the information-theoretic key agreement of multiple terminals (2008).

Communication For Omniscience by a Neutral Observer and Information-Theoretic Key Agreement of Multiple Terminals

On the communication complexity of secret key generation in the multiterminal source model

Percolation in the secrecy graph

Impossibility bounds for secure computing

Information-theoretic key agreement of multiple terminals -- part ii: channel model (2008).

1 information-theoretic key agreement of multiple terminals- part i: source model (2008).

New bounds on the information-theoretic key agreement of multiple terminals

Similar Documents

New bounds on the information-theoretic key agreement of multiple terminals.

Communication for omniscience by a neutral observer and information-theoretic key agreement of multiple terminals (2007)

New bounds on the information-theoretic key agreement of multiple terminals (2008).

Communication For Omniscience by a Neutral Observer and Information-Theoretic Key Agreement of Multiple Terminals

On the communication complexity of secret key generation in the multiterminal source model

Percolation in the secrecy graph

Impossibility bounds for secure computing

Information-theoretic key agreement of multiple terminals -- part ii: channel model (2008).

1 information-theoretic key agreement of multiple terminals- part i: source model (2008).

New bounds on the information-theoretic key agreement of multiple terminals