Yao’s garbled circuits
E926124
Yao’s garbled circuits is a foundational cryptographic protocol that enables secure two-party computation by allowing parties to jointly compute a function over their private inputs without revealing those inputs to each other.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Yao’s garbled circuits canonical | 2 |
How this entity was disambiguated
This entity first appeared as the object of triple T11438063 — 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: Yao’s garbled circuits Context triple: [Andrew Yao, knownFor, Yao’s garbled circuits]
-
A.
Naor–Yung encryption paradigm
The Naor–Yung encryption paradigm is a foundational cryptographic framework that uses double encryption and zero-knowledge proofs to transform semantically secure public-key schemes into ones secure against chosen-ciphertext attacks.
-
B.
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.
-
C.
How to Exchange Secrets by Oblivious Transfer
"How to Exchange Secrets by Oblivious Transfer" is a seminal cryptography paper by Michael O. Rabin that introduced the concept of oblivious transfer, a fundamental primitive for secure multi-party computation and privacy-preserving protocols.
-
D.
Naor–Reingold pseudorandom function
The Naor–Reingold pseudorandom function is a foundational cryptographic construction that provides a simple, efficient, and provably secure method for generating pseudorandom outputs from secret keys based on number-theoretic assumptions.
-
E.
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.
- 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: Yao’s garbled circuits Target entity description: Yao’s garbled circuits is a foundational cryptographic protocol that enables secure two-party computation by allowing parties to jointly compute a function over their private inputs without revealing those inputs to each other.
-
A.
Naor–Yung encryption paradigm
The Naor–Yung encryption paradigm is a foundational cryptographic framework that uses double encryption and zero-knowledge proofs to transform semantically secure public-key schemes into ones secure against chosen-ciphertext attacks.
-
B.
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.
-
C.
How to Exchange Secrets by Oblivious Transfer
"How to Exchange Secrets by Oblivious Transfer" is a seminal cryptography paper by Michael O. Rabin that introduced the concept of oblivious transfer, a fundamental primitive for secure multi-party computation and privacy-preserving protocols.
-
D.
Naor–Reingold pseudorandom function
The Naor–Reingold pseudorandom function is a foundational cryptographic construction that provides a simple, efficient, and provably secure method for generating pseudorandom outputs from secret keys based on number-theoretic assumptions.
-
E.
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.
- F. None of above. chosen
Statements (49)
| Predicate | Object |
|---|---|
| instanceOf |
cryptographic protocol
ⓘ
garbling scheme ⓘ secure computation protocol ⓘ two-party computation protocol ⓘ |
| alsoKnownAs | Yao’s protocol for secure two-party computation NERFINISHED ⓘ |
| application |
privacy-preserving auctions
ⓘ
privacy-preserving data mining ⓘ privacy-preserving machine learning ⓘ secure biometric matching ⓘ secure outsourcing of computation ⓘ |
| canBeExtendedTo | malicious adversary model ⓘ |
| computationalAssumption |
security of oblivious transfer protocol
ⓘ
security of underlying symmetric encryption ⓘ |
| coreIdea |
encode wire values with random labels
ⓘ
encrypt gate truth tables using wire labels ⓘ garble a Boolean circuit representing the function ⓘ |
| enables |
privacy-preserving function evaluation
ⓘ
secure two-party computation ⓘ |
| evaluatorResponsibility | evaluates the garbled circuit ⓘ |
| field |
cryptography
ⓘ
secure multiparty computation ⓘ theoretical computer science ⓘ |
| garblerResponsibility | constructs the garbled circuit ⓘ |
| goal | compute a function over private inputs without revealing the inputs ⓘ |
| influenced |
modern secure multiparty computation protocols
ⓘ
practical MPC frameworks ⓘ |
| inputPrivacyMechanism | wire labels hide actual bit values ⓘ |
| introducedAtConference | 23rd Annual IEEE Symposium on Foundations of Computer Science NERFINISHED ⓘ |
| introducedInPublication | “Protocols for secure computations” NERFINISHED ⓘ |
| inventor | Andrew Chi-Chih Yao NERFINISHED ⓘ |
| optimization |
free-XOR technique
ⓘ
point-and-permute technique ⓘ row-reduction for garbled tables ⓘ |
| optimizationGoal |
reduce communication cost
ⓘ
reduce computation cost ⓘ |
| outputProperty |
evaluator learns only the function output
ⓘ
garbler learns nothing about evaluator’s input ⓘ |
| partyRoles |
evaluator
ⓘ
garbler ⓘ |
| publicationYear | 1982 ⓘ |
| relatedConcept |
circuit garbling
ⓘ
oblivious transfer ⓘ secure function evaluation ⓘ |
| securityProperty |
privacy of parties’ inputs
ⓘ
semi-honest security in the basic construction ⓘ |
| typicalAdversaryModel | semi-honest adversary GENERATED ⓘ |
| uses |
Boolean circuits
ⓘ
oblivious transfer ⓘ symmetric-key encryption ⓘ |
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: Yao’s garbled circuits Description of subject: Yao’s garbled circuits is a foundational cryptographic protocol that enables secure two-party computation by allowing parties to jointly compute a function over their private inputs without revealing those inputs to each other.
Referenced by (2)
Full triples — surface form annotated when it differs from this entity's canonical label.