Randomly encoding functions: a new cryptographic paradigm. (Invited talk)

DOI10.1007/978-3-642-20728-0_3MaRDI QIDQ3002098zbMATH OpenOpenAlexFDO

Authors Benny Applebaum

Publication date 19 May 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-20728-0_3

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Garbled circuits as randomized encodings of functions: a primer
• Computationally private randomizing polynomials and their applications
• Encoding functions with constant online rate or how to compress garbled circuits keys
• Encoding functions with constant online rate, or how to compress garbled circuit keys
• Succinct randomized encodings and their applications

Cited in

(12)

• On pseudorandom encodings
• On the relationship between statistical zero-knowledge and statistical randomized encodings
• Output-compressing randomized encodings and applications
• Garbled circuits as randomized encodings of functions: a primer
• Statistical randomized encodings: a complexity theoretic view
• Garbling XOR gates ``for free in the standard model
• Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
• On the inner product predicate and a generalization of matching vector families
• Encoding functions with constant online rate or how to compress garbled circuits keys
• Minimizing locality of one-way functions via semi-private randomized encodings
• Encoding functions with constant online rate, or how to compress garbled circuit keys
• Computationally private randomizing polynomials and their applications

This page was built for publication: Randomly encoding functions: a new cryptographic paradigm. (Invited talk)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3002098)