Results 1  10
of
14,037
Perfectly secure oblivious RAM without random oracles
 In Theory of Cryptography
, 2011
"... We present an algorithm for implementing a secure oblivious RAM where the access pattern is perfectly hidden in the information theoretic sense, without assuming that the CPU has access to a random oracle. In addition we prove a lover bound on the amount of randomness needed for information theoreti ..."
Abstract

Cited by 44 (0 self)
 Add to MetaCart
We present an algorithm for implementing a secure oblivious RAM where the access pattern is perfectly hidden in the information theoretic sense, without assuming that the CPU has access to a random oracle. In addition we prove a lover bound on the amount of randomness needed for information
Oblivious Transfer
"... This paper describes an algorithm for model checking a fragment of the logic of knowledge and probability in multiagent systems, with respect to a perfect recall interpretation of knowledge and agents’ subjective probability. The algorithm has been implemented in the epistemic model checker MCK. So ..."
Abstract
 Add to MetaCart
This paper describes an algorithm for model checking a fragment of the logic of knowledge and probability in multiagent systems, with respect to a perfect recall interpretation of knowledge and agents’ subjective probability. The algorithm has been implemented in the epistemic model checker MCK
Quantification and Obliviousness
, 2000
"... This paper proposes that the distinguishing characteristic of AspectOriented Programming (AOP) systems is that they allow programming by making quantified programmatic assertions over programs written by programmers oblivious to such assertions. Thus, AOP systems can be analyzed with respect to thr ..."
Abstract
 Add to MetaCart
This paper proposes that the distinguishing characteristic of AspectOriented Programming (AOP) systems is that they allow programming by making quantified programmatic assertions over programs written by programmers oblivious to such assertions. Thus, AOP systems can be analyzed with respect
Wrappers For Performance Enhancement And Oblivious Decision Graphs
, 1995
"... In this doctoral dissertation, we study three basic problems in machine learning and two new hypothesis spaces with corresponding learning algorithms. The problems we investigate are: accuracy estimation, feature subset selection, and parameter tuning. The latter two problems are related and are stu ..."
Abstract

Cited by 122 (7 self)
 Add to MetaCart
and are studied under the wrapper approach. The hypothesis spaces we investigate are: decision tables with a default majority rule (DTMs) and oblivious readonce decision graphs (OODGs).
Oblivious polynomial evaluation and oblivious neural learning
 Theoretical Computer Science
, 2001
"... Abstract. We study the problem of Oblivious Polynomial Evaluation (OPE). There are two parties, Alice who has a polynomial P, and Bob who has an input x. The goal is for Bob to compute P (x) in such way that Alice learns nothing about x and Bob learns only what can be inferred from P (x). Previously ..."
Abstract

Cited by 31 (0 self)
 Add to MetaCart
Abstract. We study the problem of Oblivious Polynomial Evaluation (OPE). There are two parties, Alice who has a polynomial P, and Bob who has an input x. The goal is for Bob to compute P (x) in such way that Alice learns nothing about x and Bob learns only what can be inferred from P (x
Oblivious Transfer is Symmetric
 In EUROCRYPT 2006, Springer (LNCS 4004
, 2006
"... Abstract. We show that oblivious transfer of bits from A to B can be obtained from a single instance of the same primitive from B to A. Our reduction is perfect and shows that oblivious transfer is in fact a symmetric functionality. This solves an open problem posed by Crépeau and Sántha in 1991. 1 ..."
Abstract

Cited by 22 (1 self)
 Add to MetaCart
Abstract. We show that oblivious transfer of bits from A to B can be obtained from a single instance of the same primitive from B to A. Our reduction is perfect and shows that oblivious transfer is in fact a symmetric functionality. This solves an open problem posed by Crépeau and Sántha in 1991. 1
Computational Methods for Oblivious Equilibrium
, 2008
"... Oblivious equilibrium is a new solution concept for approximating Markov perfect equilibrium in dynamic models of imperfect competition among heterogeneous firms. In this paper, we present algorithms for computing oblivious equilibrium and for bounding approximation error. We report results from com ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
Oblivious equilibrium is a new solution concept for approximating Markov perfect equilibrium in dynamic models of imperfect competition among heterogeneous firms. In this paper, we present algorithms for computing oblivious equilibrium and for bounding approximation error. We report results from
Reducing String Oblivious Transfer to Universal Oblivious Transfer
 Proceedings of ISIT 2000
, 2000
"... This paper is concerned with informationtheoretic reductions of 1out of2 chosen string oblivious transfer to other primitives that are as weak as possible. At Eurocrypt '97, Brassard and Crpeau presented a reduction to socalled generalized bit oblivious transfer, a primitive in which th ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
This paper is concerned with informationtheoretic reductions of 1out of2 chosen string oblivious transfer to other primitives that are as weak as possible. At Eurocrypt '97, Brassard and Crpeau presented a reduction to socalled generalized bit oblivious transfer, a primitive in which
Oblivious Network RAM and Leveraging Parallelism to Achieve Obliviousness
"... Abstract. Oblivious RAM (ORAM) is a cryptographic primitive that allows a trusted CPU to securely access untrusted memory, such that the access patterns reveal nothing about sensitive data. ORAM is known to have broad applications in secure processor design and secure multiparty computation for big ..."
Abstract
 Add to MetaCart
Abstract. Oblivious RAM (ORAM) is a cryptographic primitive that allows a trusted CPU to securely access untrusted memory, such that the access patterns reveal nothing about sensitive data. ORAM is known to have broad applications in secure processor design and secure multiparty computation
Oblivious Transfer is Symmetric
"... Abstract. We show that oblivious transfer of bits from A to B can be obtained from a single instance of the same primitive from B to A. Our reduction is perfect and shows that oblivious transfer is in fact a symmetric functionality. This solves an open problem posed by Cr'epeau and S'antha ..."
Abstract
 Add to MetaCart
Abstract. We show that oblivious transfer of bits from A to B can be obtained from a single instance of the same primitive from B to A. Our reduction is perfect and shows that oblivious transfer is in fact a symmetric functionality. This solves an open problem posed by Cr'epeau and S
Results 1  10
of
14,037