The number of Internet of Things (IoT) devices is expected to grow exponentially in the near future and produce large amounts of potentially sensitive data. The simple and low cost …
The following two computational problems are studied: Duplicate grouping: Assume thatnitems are given, each of which is labeled by an integer key from the set {0,…, U− 1} …
Quantum cryptography (or quantum key distribution) is a state-of-the-art technique that exploits properties of quantum mechanics to guarantee the secure exchange of secret keys …
MN Aman, MH Basheer, B Sikdar - IEEE Internet of Things …, 2019 - ieeexplore.ieee.org
The Internet of Things (IoT) engulfs a large number of interconnected heterogeneous devices from a wide range of pervasive application areas including health-care systems …
N Nisan, A Widgerson - Proceedings of the twenty-third annual ACM …, 1991 - dl.acm.org
The k-round two-party communication complexity was studied in the deterministic model by [14] and [4] and in the probabilistic model by [20] and[6]. We present new lower bounds that …
The study of self-testing/correcting programs was introduced in 8] in order to allow one to use program P to compute function f without trusting that P works correctly. A self-tester for f …
The innovative protocol of Juels and Weis [10] extends device authentication to low-cost RFID tags. However, despite the very simple on-tag computation there remain some …
Current constructions of cryptographic primitives typically involve a large multiplicative computational overhead that grows with the desired level of security. We explore the …
Z Zheng, Y Zhang, W Huang, S Yu… - Review of Scientific …, 2019 - pubs.aip.org
We demonstrate a 6 Gbps real-time optical quantum random number generator by measuring vacuum fluctuation. To address the common problem that speed gap exists …