Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Securing fog computing for internet of things applications: Challenges and solutions
Internet of Things (IoT) allows billions of physical objects to be connected to collect and
exchange data for offering various applications, such as environmental monitoring …
exchange data for offering various applications, such as environmental monitoring …
The security of big data in fog-enabled IoT applications including blockchain: A survey
The proliferation of inter-connected devices in critical industries, such as healthcare and
power grid, is changing the perception of what constitutes critical infrastructure. The rising …
power grid, is changing the perception of what constitutes critical infrastructure. The rising …
Accountable algorithms
JA Kroll - 2015 - search.proquest.com
Important decisions about people are increasingly made by algorithms: Votes are counted;
voter rolls are purged; financial aid decisions are made; taxpayers are chosen for audits; air …
voter rolls are purged; financial aid decisions are made; taxpayers are chosen for audits; air …
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 …
Pinocchio: Nearly practical verifiable computation
To instill greater confidence in computations outsourced to the cloud, clients should be able
to verify the correctness of the results returned. To this end, we introduce Pinocchio, a built …
to verify the correctness of the results returned. To this end, we introduce Pinocchio, a built …
SNARKs for C: Verifying program executions succinctly and in zero knowledge
An argument system for NP is a proof system that allows efficient verification of NP
statements, given proofs produced by an untrusted yet computationally-bounded prover …
statements, given proofs produced by an untrusted yet computationally-bounded prover …
Quadratic span programs and succinct NIZKs without PCPs
We introduce a new characterization of the NP complexity class, called Quadratic Span
Programs (QSPs), which is a natural extension of span programs defined by Karchmer and …
Programs (QSPs), which is a natural extension of span programs defined by Karchmer and …
Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
We construct the first (key-policy) attribute-based encryption (ABE) system with short secret
keys: the size of keys in our system depends only on the depth of the policy circuit, not its …
keys: the size of keys in our system depends only on the depth of the policy circuit, not its …
SNARGs for from LWE
We provide the first construction of a succinct non-interactive argument (SNARG) for all
polynomial time deterministic computations based on standard assumptions. For T steps of …
polynomial time deterministic computations based on standard assumptions. For T steps of …
Attribute-based encryption with verifiable outsourced decryption
Attribute-based encryption (ABE) is a public-key-based one-to-many encryption that allows
users to encrypt and decrypt data based on user attributes. A promising application of ABE is …
users to encrypt and decrypt data based on user attributes. A promising application of ABE is …