نتایج جستجو برای: information theoretic limits

تعداد نتایج: 1284145  

2010
Takenobu Seito Tadashi Aikawa Junji Shikata Tsutomu Matsumoto

Journal: :CoRR 2011
Michael Huber

In the splitting model, information theoretic authentication codes allow non-deterministic encoding, that is, several messages can be used to communicate a particular plaintext. Certain applications require that the aspect of secrecy should hold simultaneously. Ogata–Kurosawa–Stinson–Saido (2004) have constructed optimal splitting authentication codes achieving perfect secrecy for the special c...

2000
Takaaki Mizuki Hiroki Shizuya Takao Nishizeki

Using a random deal of cards to players and a computationally unlimited eavesdropper, all players wish to share a common one-bit secret key which is information-theoretically secure from the eavesdropper. This can be done by the so-called key set protocol. In this paper we give a necessary and sufficient condition for a key set protocol to be “optimal,” that is, to succeed always in sharing a o...

Journal: :IACR Cryptology ePrint Archive 2006
Madhukar Anand Eric Cronin Micah Sherr Matt Blaze Sampath Kannan

We investigate the security properties of isotropic channels, broadcast media in which a receiver cannot reliably determine whether a message originated from any particular sender and a sender cannot reliably direct a message away from any particular receiver. We show that perfect isotropism implies perfect (informationtheoretic) secrecy, and that asymptotically close to perfect secrecy can be ...

2013
Mahabir Prasad Jhanwar Reihaneh Safavi-Naini

An n-player (t, δ)-secure robust secret sharing scheme is a (t, n)-threshold secret sharing scheme with the additional property that the secret can be recovered, with probability at least 1− δ, from the set of all shares even if up to t players provide incorrect shares. The existing constructions of robust secret sharing schemes for the range n/3 ≤ t < n/2 have the share size larger than the se...

2005
Lillie Coney Joseph Lorenzo Hall Poorvi L. Vora David A. Wagner

This paper provides a definition for perfect privacy in electronic and other voting systems, and an entropy-based criterion to measure the deviation from perfect privacy. Its use is illustrated with examples.

Journal: :IEEE Transactions on Vehicular Technology 2022

In connected vehicular networks, it is vital to have nodes that are capable of sensing surrounding environments and exchanging messages with each other for automating coordinating purposes. Towards this end, integrated communication (ISAC), combining both systems jointly utilize their resources pursue mutual benefits, emerges as a new cost-effective solution. ISAC, the hardware spectrum co-shar...

Journal: :EURASIP Journal on Bioinformatics and Systems Biology 2007

Journal: :Transactions of the American Mathematical Society 2002

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید