English
Related papers

Related papers: Non-Malleable Extractors, Two-Source Extractors an…

200 papers

Multi-particle sources constitute an interesting new paradigm following the recent development of on-demand single-electron sources. Versatile devices can be designed using several single-electron sources, possibly of different types,…

Mesoscale and Nanoscale Physics · Physics 2020-02-17 Michael Moskalets , Janne Kotilahti , Pablo Burset , Christian Flindt

Differential privacy is a leading protection setting, focused by design on individual privacy. Many applications, in medical / pharmaceutical domains or social networks, rather posit privacy at a group level, a setting we call integral…

Machine Learning · Statistics 2019-07-04 Hisham Husain , Zac Cranko , Richard Nock

Recently, a secrecy measure based on list-reconstruction has been proposed [2], in which a wiretapper is allowed to produce a list of $2^{mR_{L}}$ reconstruction sequences and the secrecy is measured by the minimum distortion over the…

Information Theory · Computer Science 2017-07-25 Lei Yu , Houqiang Li , Weiping Li

Differentially private (DP) synthetic data, which closely resembles the original private data while maintaining strong privacy guarantees, has become a key tool for unlocking the value of private data without compromising privacy. Recently,…

Machine Learning · Computer Science 2025-05-21 Zinan Lin , Tadas Baltrusaitis , Wenyu Wang , Sergey Yekhanin

Key extraction via measuring a physical quantity is a class of information theoretic key exchange protocols that rely on the physical characteristics of the communication channel to enable the computation of a shared key by two (or more)…

Cryptography and Security · Computer Science 2015-12-17 Matt Edman , Aggelos Kiayias , Qiang Tang , Bulent Yener

In this paper, we study the maximum entropy sampling problem (MESP) and its variants. MESP seeks to identify a small subset of variables that maximizes the determinant of a covariance submatrix, and is a fundamental model in optimal…

Optimization and Control · Mathematics 2026-04-14 Lingqing Shen , Fatma Kılınç-Karzan

The second-order achievable asymptotics in typical random number generation problems such as resolvability, intrinsic randomness, fixed-length source coding are considered. In these problems, several researchers have derived the first-order…

Information Theory · Computer Science 2013-01-01 Ryo Nomura , Te Sun Han

The main practical limitation of the McEliece public-key encryption scheme is probably the size of its key. A famous trend to overcome this issue is to focus on subclasses of alternant/Goppa codes with a non trivial automorphism group. Such…

Information Theory · Computer Science 2014-05-21 Jean-Charles Faugère , Ayoub Otmani , Ludovic Perret , Frédéric de Portzamparc , Jean-Pierre Tillich

We introduce the notion of "non-malleability" of a quantum state encryption scheme (in dimension d): in addition to the requirement that an adversary cannot learn information about the state, here we demand that no controlled modification…

Quantum Physics · Physics 2017-08-01 Andris Ambainis , Jan Bouda , Andreas Winter

A new framework is introduced for examining and evaluating the fundamental limits of lossless data compression, that emphasizes genuinely non-asymptotic results. The {\em sample complexity} of compressing a given source is defined as the…

Information Theory · Computer Science 2026-04-16 Terence Viaud , Ioannis Kontoyiannis

The problem of robust utility maximization in an incomplete market with volatility uncertainty is considered, in the sense that the volatility of the market is only assumed to lie between two given bounds. The set of all possible models…

Probability · Mathematics 2015-04-07 Anis Matoussi , Dylan Possamaï , Chao Zhou

We investigate 2-variable expanders and 3-source extractors in prime fields. We extend previous results of J. Bourgain.

Number Theory · Mathematics 2015-06-05 Norbert Hegyvári , François Hennecart

We study a semantic communication problem with a privacy constraint where an encoder consists of two separate parts, e.g., encoder 1 and encoder 2. The first encoder has access to information source $X=(X_1,\ldots,X_N)$ which is arbitrarily…

Information Theory · Computer Science 2024-12-24 Amirreza Zamani , Mikael Skoglund

Non-malleable codes are randomized codes that protect coded messages against modification by functions in a tampering function class. These codes are motivated by providing tamper resilience in applications where a cryptographic secret is…

Cryptography and Security · Computer Science 2017-08-21 Fuchun Lin , Reihaneh Safavi-Naini , Mahdi Cheraghchi , Huaxiong Wang

In this work, the critical role of noisy feedback in enhancing the secrecy capacity of the wiretap channel is established. Unlike previous works, where a noiseless public discussion channel is used for feedback, the feed-forward and…

Information Theory · Computer Science 2016-11-18 Lifeng Lai , Hesham El Gamal , H. Vincent Poor

While massive valuable deep models trained on large-scale data have been released to facilitate the artificial intelligence community, they may encounter attacks in deployment which leads to privacy leakage of training data. In this work,…

Cryptography and Security · Computer Science 2023-08-04 Bochao Liu , Pengju Wang , Shikun Li , Dan Zeng , Shiming Ge

This paper considers lossy source coding of $n$-dimensional memoryless sources and shows an explicit approximation to the minimum source coding rate required to sustain the probability of exceeding distortion $d$ no greater than $\epsilon$,…

Information Theory · Computer Science 2017-02-28 Victoria Kostina

Model extraction attacks aim to replicate the functionality of a black-box model through query access, threatening the intellectual property (IP) of machine-learning-as-a-service (MLaaS) providers. Defending against such attacks is…

Cryptography and Security · Computer Science 2025-06-04 Xueqi Cheng , Minxing Zheng , Shixiang Zhu , Yushun Dong

In ontology-based data access, multiple data sources are integrated using an ontology and mappings. In practice, this is often achieved by a bootstrapping process, that is, the ontology and mappings are first designed to support only the…

Databases · Computer Science 2020-11-19 Carsten Lutz , Johannes Marti , Leif Sabellek

Many large-scale testing procedures learn signal structure from the data to boost power. Direct data reuse can inflate Type-I error ("double dipping"), so a common remedy is masking: withholding some information during learning and using it…

Statistics Theory · Mathematics 2026-04-02 Abhinav Chakraborty , Junu Lee , Eugene Katsevich