Yao’s garbled circuits

E926124

cryptographic protocol garbling scheme secure computation protocol two-party computation protocol

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.

Jump to: Statements Referenced by

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 ⓘ

Referenced by (2)

Full triples — surface form annotated when it differs from this entity's canonical label.

Andrew Yao → knownFor → Yao’s garbled circuits ⓘ

Andrew Yao → notableConcept → Yao’s garbled circuits ⓘ