A joint Shannon cipher and privacy amplification approach to attaining exponentially decaying information leakage

DOI10.1016/J.INS.2016.03.049MaRDI QIDQ2279660zbMATH OpenOpenAlexWikidataFDO

Authors Yahya S. Khiabani, Shuangqing Wei

Publication date 13 December 2019

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ins.2016.03.049

zbMATH Keywords

equivocationrandomness extractor\(L_{1}\) norm distancesecrecy exponentuniversal\(_{2}\) hash functionsRényi entropy

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Exponential Decreasing Rate of Leaked Information in Universal Random Privacy Amplification
• Privacy amplification with asymptotically optimal entropy loss
• Privacy amplification with asymptotically optimal entropy loss
• Tight Exponential Analysis of Universally Composable Privacy Amplification and Its Applications
• Privacy amplification from non-malleable codes
• On Privacy Amplification, Lossy Compression, and Their Duality to Channel Coding
• Leakage-resilience of the Shamir secret-sharing scheme against physical-bit leakages
• Tunable Measures for Information Leakage and Applications to Privacy-Utility Tradeoffs

Cites work

• scientific article; zbMATH DE number 3833856 (Why is no real title available?)
• scientific article; zbMATH DE number 3173999 (Why is no real title available?)
• scientific article; zbMATH DE number 3908323 (Why is no real title available?)
• scientific article; zbMATH DE number 1874366 (Why is no real title available?)
• An approach for stream ciphers design based on joint computing over random and secret data
• Applications of LDPC Codes to the Wiretap Channel
• Broadcast channels with confidential messages
• Common randomness in information theory and cryptography. I. Secret sharing
• Conditional Rényi Entropies
• Cryptographic extraction and key derivation: the HKDF scheme
• Exponential Decreasing Rate of Leaked Information in Universal Random Privacy Amplification
• Extracting randomness: A survey and new constructions
• Generalized privacy amplification
• Information-theoretic key agreement: from weak to strong secret for free
• More Efficient Privacy Amplification With Less Random Seeds via Dual Universal Hash Function
• On measures of information and their characterizations
• Random ciphering bounds on a class of secrecy systems and discrete message sources
• Renyi's entropy and the probability of error
• Rényi Divergence and Kullback-Leibler Divergence
• Secret-key agreement over unauthenticated public channels-part III: privacy amplification
• Semantic security for the wiretap channel
• Simple and Tight Bounds for Information Reconciliation and Privacy Amplification
• The Wire-Tap Channel
• Tight Exponential Analysis of Universally Composable Privacy Amplification and Its Applications
• True random number generators secure in a changing environment.
• Universal Compression of Memoryless Sources Over Unknown Alphabets
• Universal classes of hash functions
• Universal hashing and authentication codes

Cited in

(1)

• Exponential Decreasing Rate of Leaked Information in Universal Random Privacy Amplification

This page was built for publication: A joint Shannon cipher and privacy amplification approach to attaining exponentially decaying information leakage

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2279660)