Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Proofs of work from worst-case assumptions
Abstract We give Proofs of Work (PoWs) whose hardness is based on well-studied worst-
case assumptions from fine-grained complexity theory. This extends the work of (Ball et al …
case assumptions from fine-grained complexity theory. This extends the work of (Ball et al …
Revisiting non-malleable secret sharing
A threshold secret sharing scheme (with threshold t) allows a dealer to share a secret
among a set of parties such that any group of t or more parties can recover the secret and no …
among a set of parties such that any group of t or more parties can recover the secret and no …
Non-malleable codes with optimal rate for poly-size circuits
We give an explicit construction of non-malleable codes with rate 1-o (1) for the tampering
class of poly-size circuits. This rate is optimal, and improves upon the previous explicit …
class of poly-size circuits. This rate is optimal, and improves upon the previous explicit …
Non-malleable codes for small-depth circuits
We construct efficient, unconditional non-malleable codes that are secure against tampering
functions computed by small-depth circuits. For constant-depth circuits of polynomial size (ie …
functions computed by small-depth circuits. For constant-depth circuits of polynomial size (ie …
Four-state non-malleable codes with explicit constant rate
Abstract Non-malleable codes (NMCs), introduced by Dziembowski, Pietrzak and Wichs
(ITCS 2010), provide a powerful guarantee in scenarios where the classical notion of error …
(ITCS 2010), provide a powerful guarantee in scenarios where the classical notion of error …
A constant rate non-malleable code in the split-state model
Non-malleable codes, introduced by Dziembowski, Pietrzak and Wichs in ICS 2010, have
emerged in the last few years as a fundamental object at the intersection of cryptography …
emerged in the last few years as a fundamental object at the intersection of cryptography …
Non-malleable encryption: simpler, shorter, stronger
One approach toward basing public-key encryption (PKE) schemes on weak and credible
assumptions is to build “stronger” or more general schemes generically from “weaker” or …
assumptions is to build “stronger” or more general schemes generically from “weaker” or …
Non-malleable codes for bounded parallel-time tampering
Non-malleable codes allow one to encode data in such a way that once a codeword is being
tampered with, the modified codeword is either an encoding of the original message, or a …
tampered with, the modified codeword is either an encoding of the original message, or a …
Rate one-third non-malleable codes
At ITCS 2010, Dziembowski, Pietrzak, and Wichs introduced Non-malleable Codes (NMCs)
which protect against tampering of a codeword of a given message into the codeword of a …
which protect against tampering of a codeword of a given message into the codeword of a …
Non-malleable codes against bounded polynomial time tampering
We construct efficient non-malleable codes (NMC) that are (computationally) secure against
tampering by functions computable in any fixed polynomial time. Our construction is in the …
tampering by functions computable in any fixed polynomial time. Our construction is in the …