A privacy-aware PUFs-based multiserver authentication protocol in cloud-edge IoT systems using blockchain

Y Zhang, B Li, B Liu, Y Hu… - IEEE Internet of Things …, 2021 - ieeexplore.ieee.org
The combination of the Internet of Things (IoT) and cloud-edge (CE) paradigm promises to
be an efficient system to aggregate and further process huge volumes of data from IoT …

Two-factor authentication for IoT with location information

MN Aman, MH Basheer, B Sikdar - IEEE Internet of Things …, 2018 - ieeexplore.ieee.org
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 …

A reliable randomized algorithm for the closest-pair problem

M Dietzfelbinger, T Hagerup, J Katajainen… - Journal of Algorithms, 1997 - Elsevier
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} …

[图书][B] Quantum cryptography and secret-key distillation

G Van Assche - 2006 - books.google.com
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 …

Data provenance for IoT with light weight authentication and privacy preservation

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 …

[PDF][PDF] Rounds in communication complexity revisited

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 …

[PDF][PDF] Self-testing/correcting for polynomials and for approximate functions

P Gemmell, R Lipton, R Rubinfeld, M Sudan… - STOC, 1991 - Citeseer
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 …

: Increasing the Security and Efficiency of

H Gilbert, MJB Robshaw, Y Seurin - … on the Theory and Applications of …, 2008 - Springer
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 …

Cryptography with constant computational overhead

Y Ishai, E Kushilevitz, R Ostrovsky… - Proceedings of the fortieth …, 2008 - dl.acm.org
Current constructions of cryptographic primitives typically involve a large multiplicative
computational overhead that grows with the desired level of security. We explore the …

6 Gbps real-time optical quantum random number generator based on vacuum fluctuation

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 …