English
Related papers

Related papers: Dynamic proofs of retrievability with low server s…

200 papers

We consider the problem of designing private information retrieval (PIR) schemes on data of $m$ files replicated on $n$ servers that can possibly collude. We focus on devising robust PIR schemes that can tolerate stragglers, i.e., slow or…

Information Theory · Computer Science 2018-09-07 Rawad Bitar , Salim El Rouayheb

Today's cloud storage services must offer storage reliability and fast data retrieval for large amount of data without sacrificing storage cost. We present SEARS, a cloud-based storage system which integrates erasure coding and data…

Distributed, Parallel, and Cluster Computing · Computer Science 2016-11-18 Ying Li , Katherine Guo , Xin Wang , Emina Soljanin , Thomas Woo

CORL is an open-source library that provides thoroughly benchmarked single-file implementations of both deep offline and offline-to-online reinforcement learning algorithms. It emphasizes a simple developing experience with a…

Machine Learning · Computer Science 2023-10-30 Denis Tarasov , Alexander Nikulin , Dmitry Akimov , Vladislav Kurenkov , Sergey Kolesnikov

A private information retrieval (PIR) protocol guarantees that a user can privately retrieve files stored in a database without revealing any information about the identity of the requested file. Existing information-theoretic PIR protocols…

Information Theory · Computer Science 2021-02-02 Hsuan-Yin Lin , Siddhartha Kumar , Eirik Rosnes , Alexandre Graell i Amat , Eitan Yaakobi

In an emerging computing paradigm, computational capabilities, from processing power to storage capacities, are offered to users over communication networks as a cloud-based service. There, demanding computations are outsourced in order to…

Symbolic Computation · Computer Science 2018-07-24 Jean-Guillaume Dumas

Many emerging Web services, such as email, photo sharing, and web site archives, need to preserve large amounts of quickly-accessible data indefinitely into the future. In this paper, we make the case that these applications' demands on…

Digital Libraries · Computer Science 2007-05-23 Mary Baker , Mehul Shah , David S. H. Rosenthal , Mema Roussopoulos , Petros Maniatis , TJ Giuli , Prashanth Bungale

We survey our results about verification of adaptable processes. We present adaptable processes as a way of overcoming the limitations that process calculi have for describing patterns of dynamic process evolution. Such patterns rely on…

Logic in Computer Science · Computer Science 2015-12-25 Mario Bravetti

Proof-of-work(PoW) is an algorithmic tool used to secure networks by imposing a computational cost on participating devices. Unfortunately, traditional PoW schemes require that correct devices perform significant computational work in…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-11-18 Diksha Gupta , Jared Saia , Maxwell Young

Private information retrieval (PIR) is a cryptographic primitive that allows a client to securely query one or multiple servers without revealing their specific interests. In spite of their strong security guarantees, current PIR…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-10-14 Mpoki Mwaisela , Peterson Yuhala , Pascal Felber , Valerio Schiavoni

In today's connected world, resource constrained devices are deployed for sensing and decision making applications, ranging from smart cities to environmental monitoring. Those recourse constrained devices are connected to create real-time…

Cryptography and Security · Computer Science 2020-01-22 Deepak Puthal , Saraju P. Mohanty , Venkata P. Yanambaka , Elias Kougianos

Permissionless blockchains achieve consensus while allowing unknown nodes to join and leave the system at any time. They typically come in two flavors: proof of work (PoW) and proof of stake (PoS), and both are vulnerable to attacks. PoS…

Cryptography and Security · Computer Science 2026-01-12 Ali Farahbakhsh , Giuliano Losa , Youer Pu , Lorenzo Alvisi , Ittay Eyal

The exponential explosion of parallel interleavings remains a fundamental challenge to model checking of concurrent programs. Both partial-order reduction (POR) and transaction reduction (TR) decrease the number of interleavings in a…

Logic in Computer Science · Computer Science 2018-02-09 Alfons Laarman

As predictive models are increasingly being deployed in high-stakes decision making (e.g., loan approvals), there has been growing interest in post hoc techniques which provide recourse to affected individuals. These techniques generate…

Machine Learning · Computer Science 2021-07-14 Sohini Upadhyay , Shalmali Joshi , Himabindu Lakkaraju

Proof-of-Location (PoL) is a lightweight security concept for Internet-of-Things (IoT) networks, focusing on the sensor nodes as the least performant and most vulnerable parts of IoT networks. PoL builds on the identification of network…

Cryptography and Security · Computer Science 2023-03-01 Simon Tschirner , Katharina Zeuch , Sascha Kaven , Lorenz Bornholdt , Volker Skwarek

We propose an efficient protocol for secure comparison of integers when both integers are shared between two parties. Such protocols are useful for implementing secure auctions. The proposed protocol's computational complexity is roughly…

Cryptography and Security · Computer Science 2012-04-16 Rajendra S. Katti , Cristinel Ababei

Modern mathematics is built on the idea that proofs should be translatable into formal proofs, whose validity is an objective question, decidable by a computer. Yet, in practice, proofs are informal and may omit many details. An agent…

Computer Science and Game Theory · Computer Science 2021-10-14 Sylvain Carré , Franck Gabriel , Clément Hongler , Gustavo Lacerda , Gloria Capano

The recently developed dynamic discretization discovery (DDD) is a powerful method that allows many time-dependent problems to become more tractable. While DDD has been applied to a variety of problems, one particular challenge has been to…

Discrete Mathematics · Computer Science 2023-03-03 Madison Van Dyk , Jochen Koenemann

Security protocols are concurrent processes that communicate using cryptography with the aim of achieving various security properties. Recent work on their formal verification has brought procedures and tools for deciding trace equivalence…

Cryptography and Security · Computer Science 2015-09-08 David Baelde , Stéphanie Delaune , Lucca Hirschi

Semi-supervised learning (SSL) algorithms have had great success in recent years in limited labeled data regimes. However, the current state-of-the-art SSL algorithms are computationally expensive and entail significant compute time and…

Machine Learning · Computer Science 2021-10-29 Krishnateja Killamsetty , Xujiang Zhao , Feng Chen , Rishabh Iyer

Private information retrieval (PIR) is the problem of privately retrieving one out of $M$ original files from $N$ severs, i.e., each individual server learns nothing about the file that the user is requesting. Usually, the $M$ files are…

Information Theory · Computer Science 2020-03-13 Jie Li , David Karpuk , Camilla Hollanti
‹ Prev 1 3 4 5 6 7 10 Next ›