Results 21 to 30 of about 15,386 (267)
Algorithmica, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rasmus Pagh +3 more
openaire +4 more sources
Unconditionally Secure Oblivious Transfer Based on Channel Delays [PDF]
, 2011 Without the use of computational assumptions, unconditionally secure oblivious transfer (OT) is impossible in the standard model where the parties are using a clear channel. Such impossibilities can be overcome by using a noisy channel.
Atsuko Miyaji +3 more
core +1 more source
Information-Theoretically Secure String Commitments Based on Packet Reordering Channels
IEEE Access, 2021 Realizing fundamental cryptographic primitives with unconditional security is a central topic in information-theoretic cryptography. These primitives can be realized based on physical assumptions, such as the existence of noisy channels, an upper bound ...
Vinicius de Morais Alves +3 more
doaj +1 more source
Oblivious and Semi-Oblivious Boundedness for Existential Rules [PDF]
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019 We study the notion of boundedness in the context positive existential rules, that is, wether there exists an upper bound to the depth of the chase procedure, that is independent from the initial instance. By focussing our attention on the oblivious and the semi-oblivious chase variants, we give a characterization of boundedness in terms of FO ...
Bourhis, Pierre +5 more
openaire +4 more sources
All-or-nothing oblivious transfer based on the quantum one-way function
Frontiers in Physics, 2022 Oblivious transfer (OT) is one of the keystones of secure multi-party computation. It is generally believed that unconditionally secure OT is impossible.
Ping Wang +4 more
doaj +1 more source
04301 Abstracts Collection – Cache-Oblivious and Cache-Aware Algorithms [PDF]
, 2005 The Dagstuhl Seminar 04301 ``Cache-Oblivious and Cache-Aware Algorithms'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl, from 18.07.2004 to 23.07.2004.
Arge, Lars +4 more
core +1 more source
Compacting oblivious agents on dynamic rings [PDF]
PeerJ Computer Science, 2021 In this paper we investigate dynamic networks populated by autonomous mobile agents. Dynamic networks are networks whose topology can change continuously, at unpredictable locations and at unpredictable times.
Shantanu Das +3 more
doaj +2 more sources
Tatra Mountains Mathematical Publications, 2016 AbstractEvaluating arbitrary functions on encrypted data is one of the holy grails of cryptography, with Fully Homomorphic Encryption (FHE) being probably the most prominent and powerful example. FHE, in its current state is, however, not efficient enough for practical applications.
Stefan Rass +2 more
openaire +2 more sources
Efficient oblivious transfer with membership verification
International Journal of Distributed Sensor Networks, 2019 In this article, we introduce a new concept of oblivious transfer with membership verification that allows any legitimate group users to obtain services from a service provider in an oblivious manner.
Weiwei Liu, Da-Zhi Sun, Yangguang Tian
doaj +1 more source
Monotone Submodular Maximization over a Matroid via Non-Oblivious Local Search [PDF]
, 2013 We present an optimal, combinatorial 1−1/e approximation algorithm for monotone submodular optimization over a matroid constraint. Compared to the continuous greedy algorithm (Calinescu, Chekuri, Pál and Vondrák, 2008), our algorithm is extremely simple ...
Filmus, Yuval +3 more
core +1 more source