Results 1  10
of
676
How to Garble RAM Programs
"... Assuming solely the existence of oneway functions, we show how to construct Garbled RAM Programs (GRAM) where its size only depends on fixed polynomial in the security parameter times the program running time. We stress that we avoid converting the RAM programs into circuits. As an example, our tec ..."
Abstract

Cited by 22 (2 self)
 Add to MetaCart
Assuming solely the existence of oneway functions, we show how to construct Garbled RAM Programs (GRAM) where its size only depends on fixed polynomial in the security parameter times the program running time. We stress that we avoid converting the RAM programs into circuits. As an example, our
How to Efficiently Evaluate RAM Programs with Malicious Security
, 2015
"... Secure 2party computation (2PC) is becoming practical for some applications. However, most approaches are limited by the fact that the desired functionality must be represented as a boolean circuit. In response, randomaccess machines (RAM programs) have recently been investigated as a promising a ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Secure 2party computation (2PC) is becoming practical for some applications. However, most approaches are limited by the fact that the desired functionality must be represented as a boolean circuit. In response, randomaccess machines (RAM programs) have recently been investigated as a promising
Indistinguishability Obfuscation of Iterated Circuits and RAM programs
, 2014
"... A key source of inefficiency in existing obfuscation schemes is that they operate on programs represented as Boolean circuits or (with stronger assumptions and costlier constructs) as Turing machines. We bring the complexity of obfuscation down to the level of RAM programs. That is, assuming inject ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
A key source of inefficiency in existing obfuscation schemes is that they operate on programs represented as Boolean circuits or (with stronger assumptions and costlier constructs) as Turing machines. We bring the complexity of obfuscation down to the level of RAM programs. That is, assuming
DEVELOPMENT OF POWER GENERATION RELIABILITY AVAILABILITY AND MAINTAINABILITY (RAM) PROGRAMS
"... Ideal plant designs perform as intended. The goal of Reliability, Availability and Maintainability (RAM) processes is to convert designs into operational task requirements to achieve lifecycle goals. This paper discusses developing Power Generation RAM programs. Given the performancebased nature of ..."
Abstract
 Add to MetaCart
Ideal plant designs perform as intended. The goal of Reliability, Availability and Maintainability (RAM) processes is to convert designs into operational task requirements to achieve lifecycle goals. This paper discusses developing Power Generation RAM programs. Given the performancebased nature
LargeScale Secure Computation: Multiparty Computation for (Parallel) RAM Programs
"... Abstract. We present the first efficient (i.e., polylogarithmic overhead) method for securely and privately processing large data sets over multiple parties with parallel, distributed algorithms. More specifically, we demonstrate loadbalanced, statistically secure computation protocols for computi ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
for computing Parallel RAM (PRAM) programs, handling (1/3−) fraction malicious players, while preserving up to polylogarithmic factors the computation and memory complexities of the PRAM program, aside from a onetime execution of a broadcast protocol per party. Additionally, our protocol has polylog
Chapter 4 RAM Programs, Turing Machines, and the Partial Recursive Functions
"... Anyone with some programming experience has an intuituive idea of the notion of “algorithm”. Even Euclid’s algorithm was called an algorithm long before the invention of modern computers. However, it was not until the 1930’s that logicians such as Church, Gödel, Kleene, Turing, and Post, put forth f ..."
Abstract
 Add to MetaCart
Anyone with some programming experience has an intuituive idea of the notion of “algorithm”. Even Euclid’s algorithm was called an algorithm long before the invention of modern computers. However, it was not until the 1930’s that logicians such as Church, Gödel, Kleene, Turing, and Post, put forth
Chapter 4 RAM Programs, Turing Machines, and the Partial Recursive Functions
"... Anyone with some programming experience has an intuituive idea of the notion of “algorithm”. Even Euclid’s algorithm was called an algorithm long before the invention of modern computers. However, it was not until the 1930’s that logicians such as Church, Gödel, Kleene, Turing, and Post, put forth f ..."
Abstract
 Add to MetaCart
Anyone with some programming experience has an intuituive idea of the notion of “algorithm”. Even Euclid’s algorithm was called an algorithm long before the invention of modern computers. However, it was not until the 1930’s that logicians such as Church, Gödel, Kleene, Turing, and Post, put forth
Chapter 4 RAM Programs, Turing Machines, and the Partial Recursive Functions
"... Anyone with some programming experience has an intuituive idea of the notion of “algorithm”. Even Euclid’s algorithm was called an algorithm long before the invention of modern computers. However, it was not until the 1930’s that logicians such as Church, Gödel, Kleene, Turing, and Post, put forth f ..."
Abstract
 Add to MetaCart
Anyone with some programming experience has an intuituive idea of the notion of “algorithm”. Even Euclid’s algorithm was called an algorithm long before the invention of modern computers. However, it was not until the 1930’s that logicians such as Church, Gödel, Kleene, Turing, and Post, put forth
UNIX Disk Access Patterns
, 1993
"... Disk access patterns are becoming ever more important to understand as the gap between processor and disk performance increases. The study presented here is a detailed characterization of every lowlevel disk access generated by three quite different systems over a two month period. The contributions ..."
Abstract

Cited by 277 (20 self)
 Add to MetaCart
, and program execution); and I/O activity is very bursty: mean request queue lengths seen by an incoming request range from 1.7 to 8.9 (1.21.9 for reads, 2.014.8 for writes), while we saw 95th percentile queue lengths as large as 89 entries, and maxima of over 1000. Using a simulator to analyze the effect
Fully succinct garbled RAM
 IACR Cryptology ePrint Archive
, 2015
"... We construct the first fully succinct garbling scheme for RAM programs, assuming the existence of indistinguishability obfuscation for circuits and oneway functions. That is, the size, space requirements, and runtime of the garbled program are the same as those of the input program, up to polyloga ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
We construct the first fully succinct garbling scheme for RAM programs, assuming the existence of indistinguishability obfuscation for circuits and oneway functions. That is, the size, space requirements, and runtime of the garbled program are the same as those of the input program, up to poly
Results 1  10
of
676