搜索结果: 1-6 共查到“军事学 Randomized encodings”相关记录6条 . 查询时间(0.18 秒)
Garbled Circuits as Randomized Encodings of Functions: a Primer
randomized encoding garbled circuits
2017/5/5
Yao's garbled circuit construction is a central cryptographic tool with numerous applications. In this tutorial, we study garbled circuits from a foundational point of view under the framework of rand...
On the Relationship between Statistical Zero-Knowledge and Statistical Randomized Encodings
Cryptography Complexity Statsitical Zero Knowldge
2016/5/30
\emph{Statistical Zero-knowledge proofs} (Goldwasser, Micali and Rackoff, SICOMP 1989) allow a computationally-unbounded server to convince a computationally-limited client that an input x is in a lan...
Succinct Randomized Encodings and their Applications
Obfuscation Randomized-Encoding Garbled-Circuit
2016/1/7
A {\em randomized encoding} allows to represent a ``complex'' function f(x) by a ``simpler'' randomized function f^(x;r) whose output distribution encodes f(x), while revealing nothing else regarding ...
Succinct Randomized Encodings and their Applications
obfuscation randomized encoding garbling
2015/12/31
A randomized encoding allows to express a “complex” computation, given by a function f and
input x, by a “simple to compute” randomized representation fb(x) whose distribution encodes
f(x), while re...
Time-Lock Puzzles from Randomized Encodings
2015/12/30
Time-lock puzzles are a mechanism for sending messages “to the future”. A sender can
quickly generate a puzzle with a solution s that remains hidden until a moderately large
amount of time t has ela...
Output-Compressing Randomized Encodings and Applications
randomized encodings obfuscation
2015/12/24
We consider randomized encodings (RE) that enable encoding a Turing machine Pi and input x into its ``randomized encoding'' \hat{Pi}(x) in sublinear, or even polylogarithmic, time in the running-time ...