oblivious RAM
E413702
Oblivious RAM is a cryptographic technique that hides a program’s memory access patterns to protect sensitive information from being inferred by observing those accesses.
All labels observed (2)
| Label | Occurrences |
|---|---|
| circuit ORAM | 1 |
| oblivious RAM canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T4087548 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: oblivious RAM Context triple: [Rafail Ostrovsky, knownFor, oblivious RAM]
-
A.
Modern Cryptography, Probabilistic Proofs and Pseudorandomness
"Modern Cryptography, Probabilistic Proofs and Pseudorandomness" is a foundational textbook that systematically develops the theoretical underpinnings of modern cryptography, focusing on probabilistic proof techniques and the theory of pseudorandomness.
-
B.
Probabilistic Encryption
Probabilistic Encryption is a cryptographic technique that uses randomness in the encryption process so that the same message encrypts to different ciphertexts, enhancing security against attackers.
-
C.
Randomness and Computation
"Randomness and Computation" is Shafi Goldwasser's influential doctoral thesis that helped lay the foundations of modern complexity theory and cryptography by rigorously exploring the role of randomness in efficient computation.
-
D.
Blum–Blum–Shub pseudorandom number generator
The Blum–Blum–Shub pseudorandom number generator is a cryptographically secure generator based on the hardness of factoring large composite numbers, widely studied in theoretical computer science and cryptography.
-
E.
Shamir secret sharing scheme
The Shamir secret sharing scheme is a cryptographic method that divides a secret into multiple parts so that only a specified threshold of parts can reconstruct the original secret, while fewer parts reveal nothing.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: oblivious RAM Target entity description: Oblivious RAM is a cryptographic technique that hides a program’s memory access patterns to protect sensitive information from being inferred by observing those accesses.
-
A.
Modern Cryptography, Probabilistic Proofs and Pseudorandomness
"Modern Cryptography, Probabilistic Proofs and Pseudorandomness" is a foundational textbook that systematically develops the theoretical underpinnings of modern cryptography, focusing on probabilistic proof techniques and the theory of pseudorandomness.
-
B.
Probabilistic Encryption
Probabilistic Encryption is a cryptographic technique that uses randomness in the encryption process so that the same message encrypts to different ciphertexts, enhancing security against attackers.
-
C.
Randomness and Computation
"Randomness and Computation" is Shafi Goldwasser's influential doctoral thesis that helped lay the foundations of modern complexity theory and cryptography by rigorously exploring the role of randomness in efficient computation.
-
D.
Blum–Blum–Shub pseudorandom number generator
The Blum–Blum–Shub pseudorandom number generator is a cryptographically secure generator based on the hardness of factoring large composite numbers, widely studied in theoretical computer science and cryptography.
-
E.
Shamir secret sharing scheme
The Shamir secret sharing scheme is a cryptographic method that divides a secret into multiple parts so that only a specified threshold of parts can reconstruct the original secret, while fewer parts reveal nothing.
- F. None of above. chosen
Statements (51)
| Predicate | Object |
|---|---|
| instanceOf |
cryptographic technique
ⓘ
data-oblivious algorithmic primitive ⓘ privacy-enhancing technology ⓘ |
| assumes | adversary can observe memory accesses ⓘ |
| canBeImplementedIn |
hardware
ⓘ
hybrid hardware–software systems ⓘ software ⓘ |
| enables |
cloud storage privacy
ⓘ
outsourced storage privacy ⓘ secure remote execution ⓘ |
| field |
computer security
ⓘ
cryptography ⓘ theoretical computer science ⓘ |
| hasComponent |
client-side stash
ⓘ
dummy memory accesses ⓘ position map ⓘ randomized data shuffling ⓘ |
| hasGoal |
hide memory access patterns
ⓘ
prevent leakage of information through access patterns ⓘ |
| hasProperty |
introduces bandwidth overhead
ⓘ
introduces computational overhead ⓘ introduces storage overhead ⓘ |
| hasVariant |
oblivious RAM
self-linksurface differs
ⓘ
surface form:
circuit ORAM
distributed ORAM ⓘ hierarchical ORAM ⓘ path ORAM ⓘ tree-based ORAM ⓘ write-only ORAM ⓘ |
| hides |
correlation between operations and data
ⓘ
read and write patterns ⓘ sequence of memory addresses accessed ⓘ |
| modeledBy | probabilistic algorithms ⓘ |
| operatesOn | RAM model of computation ⓘ |
| protects |
access pattern privacy
ⓘ
confidentiality of data usage ⓘ |
| relatedTo |
data-oblivious algorithms
ⓘ
encrypted memory ⓘ secure computation ⓘ secure processors ⓘ side-channel resistance ⓘ trusted execution environments ⓘ |
| requires | randomness ⓘ |
| securityProperty |
access pattern indistinguishability
ⓘ
computational security against polynomial-time adversaries ⓘ |
| tradeOff | performance vs privacy ⓘ |
| typicalOverhead | polylogarithmic in memory size ⓘ |
| usedIn |
encrypted virtual machines
ⓘ
hardware security architectures ⓘ private information retrieval constructions ⓘ secure multi-party computation protocols ⓘ secure outsourced databases ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: oblivious RAM Description of subject: Oblivious RAM is a cryptographic technique that hides a program’s memory access patterns to protect sensitive information from being inferred by observing those accesses.
Referenced by (2)
Full triples — surface form annotated when it differs from this entity's canonical label.
this entity surface form:
circuit ORAM