搜索结果: 1-9 共查到“军事学 Turing machines”相关记录9条 . 查询时间(0.125 秒)
Output Compression, MPC, and iO for Turing Machines
Randomized encodings compact MPC indistinguishability obfuscation
2018/11/13
In this work, we study the fascinating notion of output-compressing randomized encodings for Turing Machines, in a shared randomness model. In this model, the encoder and decoder have access to a shar...
FE and iO for Turing Machines from Minimal Assumptions
indistinguishability obfuscation functional encryption Turing machines
2018/11/9
We construct Indistinguishability Obfuscation (iO) and Functional Encryption (FE) schemes in the Turing machine model from the minimal assumption of compact FE for circuits (CktFE). Our constructions ...
We give a simple construction of indistinguishability obfuscation for Turing machines where the time to obfuscate grows only with the description size of the machine and otherwise, independent of the ...
Attribute-Based Signatures for Turing Machines
attribute-based signatures Turing machines indistinguishability obfuscation
2017/8/29
Attribute-based signatures (ABS) support restricted signing keys which allow signers to sign messages with respect to specific signing credentials or attributes that are accepted by the signing polici...
Indistinguishability Obfuscation for Turing Machines with Unbounded Memory
Turing Machines Unbounded Memory
2016/1/6
We show how to build indistinguishability obfuscation (iO) for Turing Machines where the overhead
is polynomial in the security parameter λ, machine description |M| and input size |x| (with only a
n...
In this work, we construct an adaptively secure functional encryption for Turing machines scheme, based on
indistinguishability obfuscation for circuits. Our work places no restrictions on the types ...
How to Run Turing Machines on Encrypted Data
Functional encryption Fully homomorphic encryption
2014/3/13
Algorithms for computing on encrypted data promise to be a fundamental building block of cryptography. The way one models such algorithms has a crucial effect on the efficiency and usefulness of the r...
Physical Turing Machines and the Formalization of Physical Cryptography
Physical Turing machines physical cryptography
2012/3/28
We introduce an extension of the standard Turing machine model, so-called Physical Turing machines, and apply them in a reductionist security proof for a standard scheme from physical cryptography.
Simulation-Based Security with Inexhaustible Interactive Turing Machines
Simulation-Based Security Interactive Turing Machines
2008/11/18
Recently, there has been much interest in extending models
for simulation-based security in such a way that the runtime of protocols
may depend on the length of their input. Finding such extensions ...