Doubly efficient private information retrieval and fully homomorphic RAM computation from ring LWE
A (single server) private information retrieval (PIR) allows a client to read data from a public
database held on a remote server, without revealing to the server which locations she is …
database held on a remote server, without revealing to the server which locations she is …
On the optimal succinctness and efficiency of functional encryption and attribute-based encryption
We investigate the best-possible (asymptotic) efficiency of functional encryption (FE) and
attribute-based encryption (ABE) by proving inherent space-time trade-offs and constructing …
attribute-based encryption (ABE) by proving inherent space-time trade-offs and constructing …
[PDF][PDF] SAT-based generation of planar graphs
M Kirchweger, M Scheucher… - … Conference on Theory …, 2023 - drops.dagstuhl.de
To test a graph's planarity in SAT-based graph generation we develop SAT encodings with
dynamic symmetry breaking as facilitated in the SAT modulo Symmetry (SMS) framework …
dynamic symmetry breaking as facilitated in the SAT modulo Symmetry (SMS) framework …
Enumeration Complexity: Incremental Time, Delay and Space
Y Strozecki - arXiv preprint arXiv:2309.17042, 2023 - arxiv.org
"Manuscript title" Page 1 UNIVERSITE DE VERSAILLES SAINT-QUENTIN-EN-YVELINES
Laboratoire Données et Algorithmes pour une Ville Intelligente et Durable David – UR 7431 …
Laboratoire Données et Algorithmes pour une Ville Intelligente et Durable David – UR 7431 …
[PDF][PDF] Efficient and Secure k-NN Classification from Improved Data-Oblivious Programs and Homomorphic Encryption.
The k-nearest neighbors classifier is a simple machine learning algorithm with applications
in image recognition, finance, medical diagnosis and so on. It involves a measurement …
in image recognition, finance, medical diagnosis and so on. It involves a measurement …
Efficient answer enumeration in description logics with functional roles
C Lutz, M Przybyłko - Proceedings of the AAAI Conference on Artificial …, 2023 - ojs.aaai.org
We study the enumeration of answers to ontology-mediated queries when the ontology is
formulated in a description logic that supports functional roles and the query is a CQ. In …
formulated in a description logic that supports functional roles and the query is a CQ. In …
Quantum random access stored-program machines
Random access machines (RAMs) and random access stored-program machines (RASPs)
are models of computing that are closer to the architecture of real-world computers than …
are models of computing that are closer to the architecture of real-world computers than …
Programmable and parallel water computing
A Henderson, R Nicolescu, MJ Dinneen… - Journal of Membrane …, 2023 - Springer
We further the work on a recently proposed membrane computing model which utilises
decentralised water tanks interconnected by pipes with water flow controlled by valves …
decentralised water tanks interconnected by pipes with water flow controlled by valves …
Adoption and evaluation of a multistatic Fourier-based synthetic aperture radar method for ultrasound imaging
EMG Dorausch, D Swist, M Herzog… - Medical Imaging …, 2023 - spiedigitallibrary.org
Multistatic synthetic aperture (SA) imaging allows for dynamic focusing for all points in the
image, in contrast to conventional beamforming techniques. As further improvement of …
image, in contrast to conventional beamforming techniques. As further improvement of …
Quantum Speedups for Bayesian Network Structure Learning
J Harviainen, K Rychkova, M Koivisto - arXiv preprint arXiv:2305.19673, 2023 - arxiv.org
The Bayesian network structure learning (BNSL) problem asks for a directed acyclic graph
that maximizes a given score function. For networks with $ n $ nodes, the fastest known …
that maximizes a given score function. For networks with $ n $ nodes, the fastest known …