Y Ma, J Zhao, K Li, Y Cao, H Chen… - International Journal of …, 2021 - igi-global.com
With the advent and development of database applications such as big data and data mining, how to ensure the availability of data without revealing sensitive information has …
We consider the secure search problem of retrieving from an unsorted data cost=(x_1,..., xm) an item (i, xi) matching a given lookup value l (for a generic matching criterion either …
D Feldman, Z Kfir, X Wu - arXiv preprint arXiv:1906.04895, 2019 - arxiv.org
An $\varepsilon $-coreset for a given set $ D $ of $ n $ points, is usually a small weighted set, such that querying the coreset\emph {provably} yields a $(1+\varepsilon) $-factor …
Abstract An (n, m, t)-homomorphic secret sharing (HSS) scheme allows n clients to share their inputs across m servers, such that the inputs are hidden from any t colluding servers …
Secure search is the problem of securely retrieving from a database table (or any unsorted array) the records matching specified attributes, as in SQL``SELECT... WHERE...''queries …
B Ganesh, P Palmieri - 2023 7th International Conference on …, 2023 - ieeexplore.ieee.org
Homomorphic Encryption (HE) is a very attractive solution to ensure privacy when outsourcing confidential data to the cloud, as it enables computation on the data without de …
We describe a method for approximating any bounded activation function given encrypted input data. The utility of our method is exemplified by simulating it within two typical machine …
Driven by artificial intelligence, cloud computing, autonomous driving, the Internet of Things, blockchain, quantum computing, and other emerging technologies and applications …
Our team has been studying dynamically reconfigurable chips since 2006. In 2014, we wrote the book “Reconfigurable Computing” and published it in Science Press. The book …