Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Indistinguishability obfuscation from well-founded assumptions
Indistinguishability obfuscation, introduced by [Barak et. al. Crypto 2001], aims to compile
programs into unintelligible ones while preserving functionality. It is a fascinating and …
programs into unintelligible ones while preserving functionality. It is a fascinating and …
Pad-net: Multi-tasks guided prediction-and-distillation network for simultaneous depth estimation and scene parsing
Depth estimation and scene parsing are two particularly important tasks in visual scene
understanding. In this paper we tackle the problem of simultaneous depth estimation and …
understanding. In this paper we tackle the problem of simultaneous depth estimation and …
Candidate indistinguishability obfuscation and functional encryption for all circuits
In this work, we study indistinguishability obfuscation and functional encryption for general
circuits: Indistinguishability obfuscation requires that given any two equivalent circuits C_0 …
circuits: Indistinguishability obfuscation requires that given any two equivalent circuits C_0 …
Candidate multilinear maps from ideal lattices
We describe plausible lattice-based constructions with properties that approximate the
sought-after multilinear maps in hard-discrete-logarithm groups, and show an example …
sought-after multilinear maps in hard-discrete-logarithm groups, and show an example …
Indistinguishability Obfuscation from LPN over , DLIN, and PRGs in NC
In this work, we study what minimal sets of assumptions suffice for constructing
indistinguishability obfuscation (i O). We prove: Theorem (Informal): Assume sub …
indistinguishability obfuscation (i O). We prove: Theorem (Informal): Assume sub …
Fully secure functional encryption for inner products, from standard assumptions
Functional encryption is a modern public-key paradigm where a master secret key can be
used to derive sub-keys SK_F associated with certain functions F in such a way that the …
used to derive sub-keys SK_F associated with certain functions F in such a way that the …
Attribute-based encryption for circuits
In an attribute-based encryption (ABE) scheme, a ciphertext is associated with an ℓ-bit public
index ind and a message m, and a secret key is associated with a Boolean predicate P. The …
index ind and a message m, and a secret key is associated with a Boolean predicate P. The …
Multi-input functional encryption
We introduce the problem of Multi-Input Functional Encryption, where a secret key sk f can
correspond to an n-ary function f that takes multiple ciphertexts as input. We formulate both …
correspond to an n-ary function f that takes multiple ciphertexts as input. We formulate both …
Reusable garbled circuits and succinct functional encryption
Garbled circuits, introduced by Yao in the mid 80s, allow computing a function f on an input x
without leaking anything about f or x besides f (x). Garbled circuits found numerous …
without leaking anything about f or x besides f (x). Garbled circuits found numerous …
Functional signatures and pseudorandom functions
We introduce two new cryptographic primitives: functional digital signatures and functional
pseudorandom functions. In a functional signature scheme, in addition to a master signing …
pseudorandom functions. In a functional signature scheme, in addition to a master signing …