[PDF] Top 20 Efficient verifiable delay functions

... special functions are used in [15] (under the name of slow-timed hash functions ) to construct a trustworthy randomness beacon: a service producing publicly verifiable random numbers, which are guar- ... See full document

... P furnishes a purported address-ordered transcript T , and the constraints check its correctness by ensuring that (1) tran- script T is a permutation of the execution-ordered transcript, (2) each sequential pair of ... See full document

... a verifiable outsourced computation scheme is private when the public outputs of the problem generation algorithm ProbGen over two different inputs are indistinguishable; that is, an adversary cannot decide which ... See full document

... Related work. VRFs have been constructed in bilinear groups by Lysyanskaya [Lys02] and Dodis [Dod03]. Based on Boneh-Boyen signatures [BB04b], Dodis and Yampolskiy [DY05] gave the first efficient scheme that is ... See full document

... and efficient verifiable random functions with full adaptive security and large input space from non- interactive q-type assumptions, where q is only logarithmic in the security pa- ...the ... See full document

... The verifiable random functions constructed in this paper are relatively inefficient, when compared to the q-type-based constructions of [28, 11, 2, 29], for ...more efficient VRFs from standard ... See full document

... ABSTRACT: Static logic circuits allow versatile implementation of logic functions based on static, or steady-state, behavior of simple NMOS or CMOS structures [5]. This approach, however, may require a large ... See full document

... RLWE[3] is an algebraic variant of the LWE[4] problem, both known to be reducible to the worst-case shortest vector lattice problem (thus implying re- sistance to polynomial-time quantum algorithms), with RLWE allowing ... See full document

... that the recent quasi-polynomial attacks on DLP of certain extension fields of small characteristics suggests not to use non-prime finite fields in cryptographic setting [37]. We note that all secure outsourcing ... See full document

... basic functions of the Internet of Things (IoT), in which the sensed data are concentrations from sensor nodes to the sink, with a timely style, so the smart response can be done for ...small delay are the ... See full document

... Abstract. Verifiable random functions (VRF) and selectively-convertible undeniable signature (SCUS) schemes were proposed independently in the ...are efficient, and can be run either sequentially, ... See full document

... Abstract. Demanding computations are increasingly outsourced to cloud platforms. For such outsourced computations, the efficient verifia- bility of results is a crucial requirement. When sensitive data is ... See full document

... We firstly gift a circuit cipher text-policy characteristic based hybrid encryption with verifiable delegation scheme. General circuits are used to specific the most powerful shape of get entry to control ... See full document

... have efficient zero-knowledge proofs associated to them, allowing one to prove possession of a MAC authenticating a ...an efficient type of anonymous ... See full document

... Values of σ(t) Clearly any candidate construction trivially satisfies σ(t)-sequentiality for some σ (e.g. σ(t) = 0). Thus, security becomes more meaningful as σ(t) → t. No construction can obtain σ(t) = t because by ... See full document

... publicly verifiable proof making T sequential computations, but it’s hard to come up with an accepting proof in significantly less than T sequential steps, even given access to massive ... See full document

... Prover efficiency. For the VDF application, Pietrzak’s prover is more efficient. It takes O( √ T ) group operations to construct the proof, where as for Wesolowski it takes O(T ). Both provers parallelize well and ... See full document

... hash functions (AHFs) are a generic and very useful tool to en- able partitioning proofs in the standard model, that is, without random ...[33], verifiable random functions [7,23,26,33], different ... See full document

... E2E verifiable information theoretically without any setup assumption except the existence of a bulletin board (BB) which provides a global consistent view of the ...own verifiable view of an election ... See full document

... Numerical Results. From fully verifiable schemes apart from VerPair, we choose the one that requires least computational overhead [15]. Again from [39] [41], we choose the one that requires less information [40]. ... See full document