Results 31 to 40 of about 15,386 (267)

Oblivious Network RAM and Leveraging Parallelism to Achieve Obliviousness [PDF]

open access: yesJournal of Cryptology, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dana Dachman-Soled   +4 more
openaire   +3 more sources

Lightweight Heterogeneous Secure Function Computing Acceleration Framework [PDF]

open access: yesJisuanji kexue
Currently,data has become a crucial strategic resource,and data mining and analysis technologies play an important role in various industries.However,there are risks of data leakage in the process of data mining and analysis.Secure function evaluation ...
ZHAO Chuan, HE Zhangzhao, WANG Hao, KONG Fanxing, ZHAO Shengnan, JING Shan
doaj   +1 more source

Relativized obliviousness [PDF]

open access: yes, 2005
Relativized obliviousness is introduced to capture the intuitive idea, that some problems allow fastest computations which are more oblivious than do other problems, without any of such computations being oblivious in the standard sense. It is shown that each increase in the obliviousness of an algorithm (in several different well-defined meanings ...
openaire   +2 more sources

Physical implementation of oblivious transfer using optical correlated randomness

open access: yesScientific Reports, 2017
We demonstrate physical implementation of information-theoretic secure oblivious transfer based on bounded observability using optical correlated randomness in semiconductor lasers driven by common random light broadcast over optical fibers.
Tomohiro Ito   +10 more
doaj   +1 more source

Oblivious evaluation of multivariate polynomials

open access: yesJournal of Mathematical Cryptology, 2013
One of the fundamental problems of multi-party computation is Oblivious Polynomial Evaluation. In that problem, that was introduced by Naor and Pinkas, Alice has a polynomial and Bob has a point .
Tassa Tamir   +2 more
doaj   +1 more source

On the Composability of Statistically Secure Random Oblivious Transfer

open access: yesEntropy, 2020
We show that random oblivious transfer protocols that are statistically secure according to a definition based on a list of information-theoretical properties are also statistically universally composable.
Rafael Dowsley   +2 more
doaj   +1 more source

Exon: An Oblivious Exactly-Once Messaging Protocol With Reliable Delegation

open access: yesIEEE Access
TCP is the default transport protocol of choice, namely for message-oriented middleware protocols (e.g., ZMTP, AMQP, MQTT) or distributed language runtimes (e.g., distributed Erlang), where exactly-once (EO) messaging is paramount.
Ziad Kassam   +2 more
doaj   +1 more source

Extending oblivious transfers efficiently [PDF]

open access: yes, 2003
. We consider the problem of extending oblivious transfers: Given a small number of oblivious transfers “for free, ” can one implement a large number of oblivious transfers?
Joe Kilian   +3 more
core   +1 more source

Error-tolerant oblivious transfer in the noisy-storage model

open access: yesPhysical Review Research, 2023
The noisy-storage model of quantum cryptography allows for information-theoretically secure two-party computation based on the assumption that a cheating user has at most access to an imperfect, noisy quantum memory, whereas the honest users do not need ...
Cosmo Lupo   +3 more
doaj   +1 more source

Blocking Optimality in Distributed Real-Time Locking Protocols [PDF]

open access: yesLeibniz Transactions on Embedded Systems, 2014
Lower and upper bounds on the maximum priority inversion blocking (pi-blocking) that is generally unavoidable in distributed multiprocessor real-time locking protocols (where resources may be accessed only from specific synchronization processors) are ...
Brandenburg, Björn Bernhard
doaj   +1 more source

Home - About - Disclaimer - Privacy