English
Related papers

Related papers: Leakage-Resilient Extractors against Number-on-For…

200 papers

The resiliency of a network is its ability to remain \emph{effectively} functioning also when any of its nodes or links fails. However, to reduce operational and set-up costs, a network should be small in size, and this conflicts with the…

Data Structures and Algorithms · Computer Science 2016-11-07 Davide Bilò , Luciano Gualà , Stefano Leucci , Guido Proietti

Consider the set of source distributions within a fixed maximum relative entropy with respect to a given nominal distribution. Lossless source coding over this relative entropy ball can be approached in more than one way. A problem…

Information Theory · Computer Science 2011-05-03 Michael B. Baer , Farzad Rezaei , Charalambos D. Charalambous

Quantum random number generators (QRNGs) harness the inherent unpredictability of quantum mechanics to produce true randomness. Yet, in many optical implementations, the light source remains a potential vulnerability - susceptible to…

Quantum Physics · Physics 2025-11-07 KaiWei Qiu , Yu Cai , Nelly H. Y. Ng , Jing Yan Haw

Private information retrieval protocols guarantee that a user can privately and losslessly retrieve a single file from a database stored across multiple servers. In this work, we propose to simultaneously relax the conditions of perfect…

Information Theory · Computer Science 2022-01-07 Yauhen Yakimenka , Hsuan-Yin Lin , Eirik Rosnes , Jörg Kliewer

Formal verification of power side-channel leakage and its countermeasures in cryptographic algorithms is challenging, as SAT-based methods fail to scale on XOR-heavy, time-unrolled cryptographic circuits with realistic leakage models. We…

Quantum Physics · Physics 2026-05-26 Walid El Maouaki , Alberto Marchisio , Muhammad Shafique

We propose a new model of a weakly random source that admits randomness extraction. Our model of additive sources includes such natural sources as uniform distributions on arithmetic progressions (APs), generalized arithmetic progressions…

Computational Complexity · Computer Science 2014-10-28 Abhishek Bhowmick , Ariel Gabizon , Thái Hoàng Lê , David Zuckerman

Consider a general quantum stochastic source that emits at discrete time steps quantum pure states which are chosen from a finite alphabet according to some probability distribution which may depend on the whole history. Also, fix two…

Quantum Physics · Physics 2024-12-05 George Androulakis , Rabins Wosti

Randomness extraction is indispensable for quantum random number generators, serving to eliminate bias and potential information leakage from raw measurement data. Conventional extractors operate in a block-wise fashion, requiring the…

Quantum Physics · Physics 2026-05-12 Chun-Yang Luan , Xiang-Jie Lie , Lin Cheng , Gang-Xi Wang , Cheng-Kang Pan , Xiang Zhang , Xingjian Zhang

Various studies among side-channel attacks have tried to extract information through leakages from electronic devices to reach the instruction flow of some appliances. However, previous methods highly depend on the resolution of traced…

Cryptography and Security · Computer Science 2022-08-15 Pouya Narimani , Seyed Amin Habibi , Mohammad Ali Akhaee

An extractor is a function E that is used to extract randomness. Given an imperfect random source X and a uniform seed Y, the output E(X,Y) is close to uniform. We study properties of such functions in the presence of prior quantum…

Quantum Physics · Physics 2008-02-04 Robert Koenig , Barbara M. Terhal

We consider the problem of learning a discrete distribution in the presence of an $\epsilon$ fraction of malicious data sources. Specifically, we consider the setting where there is some underlying distribution, $p$, and each data source…

Machine Learning · Computer Science 2017-11-23 Mingda Qiao , Gregory Valiant

Quantum random number generators can provide genuine randomness by appealing to the fundamental principles of quantum mechanics. In general, a physical generator contains two parts---a randomness source and its readout. The source is…

Quantum Physics · Physics 2016-03-01 Zhu Cao , Hongyi Zhou , Xiao Yuan , Xiongfeng Ma

Random quantum circuits have played a central role in establishing the computational advantages of near-term quantum computers over their conventional counterparts. Here, we use ensembles of low-depth random circuits with local connectivity…

Quantum Physics · Physics 2021-09-29 Michael J. Gullans , Stefan Krastanov , David A. Huse , Liang Jiang , Steven T. Flammia

A key component of generating text from modern language models (LM) is the selection and tuning of decoding algorithms. These algorithms determine how to generate text from the internal probability distribution generated by the LM. The…

Machine Learning · Computer Science 2023-12-05 Ali Naseh , Kalpesh Krishna , Mohit Iyyer , Amir Houmansadr

Quantum random number generators (QRNGs) output genuine random numbers based upon the uncertainty principle. A QRNG contains two parts in general --- a randomness source and a readout detector. How to remove detector imperfections has been…

Quantum Physics · Physics 2016-01-14 Zhu Cao , Hongyi Zhou , Xiongfeng Ma

LLMs are widely used, yet they remain prone to factual errors that erode user trust and limit adoption in high-risk settings. One approach to mitigate this risk is to equip models with uncertainty estimation mechanisms that abstain when…

Artificial Intelligence · Computer Science 2026-02-16 Shani Goren , Ido Galil , Ran El-Yaniv

We show that Trevisan's extractor and its variants \cite{T99,RRV99} are secure against bounded quantum storage adversaries. One instantiation gives the first such extractor to achieve an output length $\Theta(K-b)$, where $K$ is the…

Quantum Physics · Physics 2010-03-31 Anindya De , Thomas Vidick

In secure communication, highly random entropy sources are essential for information security. Random lasers (RLs), which arise from multiple scattering in disordered structures, are potentially ideal entropy sources. Traditionally, RLs are…

The generation of random numbers via quantum processes is an efficient and reliable method to obtain true indeterministic random numbers that are of vital importance to cryptographic communication and large-scale computer modeling. However,…

Quantum Physics · Physics 2015-05-20 J. Y. Haw , S. M. Assad , A. M. Lance , N. H. Y. Ng , V. Sharma , P. K. Lam , T. Symul

Information-efficient approaches for extracting randomness from imperfect sources have been extensively studied, but simpler and faster ones are required in the high-speed applications of random number generation. In this paper, we focus on…

Information Theory · Computer Science 2012-09-05 Hongchao Zhou , Jehoshua Bruck
‹ Prev 1 3 4 5 6 7 10 Next ›