[PDF] Top 20 Proofs of Work from Worst-Case Assumptions
Has 10000 "Proofs of Work from Worst-Case Assumptions" found on our website. Below are the top 20 most common "Proofs of Work from Worst-Case Assumptions".
Proofs of Work from Worst-Case Assumptions
... the work of [BRSV17a], which introduced PoWs whose hardness is based on the same worst-case assumptions we consider ...well-studied worst-case assumptions, they did not ... See full document
30
Computational Soundness of Symbolic Zero-knowledge Proofs: Weaker Assumptions and Mechanized Verification
... future work. First, current abstractions model non-interactive ZK proofs, ...ZK proofs thus requires a conceptually different approach, as such proofs cannot be replayed, put into other terms, ... See full document
36
Worst-Case to Average-Case Reductions for Module Lattices
... reductions from SIVP to SIS and Id-SIVP to R-SIS on the first hand, and from SIVP to LWE and Id-SIVP to R-LWE on the second ...new worst-case to average-case reductions: A reduction ... See full document
29
Finite volume analysis of temperature effects induced by active MRI implants: 2. Defects on active MRI implants causing hot spots
... the worst case scenario for thermal equilibrium inside a homogeneous medium without cooling ...this worst case assumptions additional conditions are considered in a numerical ... See full document
20
Simpler Efficient Group Signatures from Lattices
... In recent years, lattice cryptography has attracted significant interest, due to several potential benefits: asymptotic efficiency, worst-case hardness assumptions, and secu- rity against quantum ... See full document
31
Indistinguishable proofs of work or knowledge
... which case she will have to perform additional ...is from an approved contact or a non-approved user who successfully fulfilled the computational ...challenge from the verifier, hashes the first move ... See full document
50
Predicting Worst-Case Execution Time Trends in Long-Lived Real-Time Systems
... its hardware. As new systems and architectures are emerging that have larger uncertainties and more interactions with the environment, these applications have more significant dWCET variations which we are concerned with ... See full document
16
An optimal fixed-priority assignment algorithm for supporting fault-tolerant hard real-time systems
... the worst-case, to meet task deadlines despite internal ...of worst-case response times due to internal and external errors are used to derive the worst-case response time of ... See full document
16
Modified Quick Sort: Worst Case Made Best Case
... well from an angle which has not been discussed in the theories and analysis of quick ...considering work done in this paper, we can claim that this modification will classify quicksort’s efficiency as Ө (n ... See full document
6
Compact Accumulator using Lattices
... security from hardness assumption of the SIS problem (which is itself implied by worst-case lattice ...zero-knowledge proofs of membership can be ... See full document
11
Ultrasound and shockwave therapy for acute fractures in adults (protocol)
... information from the authors of the in- cluded studies where the published information or data were in- ...available, from stan- dard errors, confidence intervals or exact P ...determined from the ... See full document
56
Zero-Knowledge Proofs with Low Amortized Communication from Lattice Assumptions
... zero-knowledge proofs can incur a large communication cost, which in- creases the overall communication complexity of the MPC protocol in which they are ...all proofs. In this work, we answer this ... See full document
23
Improved Automotive CAN Protocol Based on Payload Reduction and Selective Bit Stuffing
... the work is benchmarked with SAEJ1939 Heavy commercial vehicle CAN ...the worst case response time of CAN extended frame from 160 µ sec to 144 µ ... See full document
15
Proofs of Replicated Storage Without Timing Assumptions
... in case of failure of local ...provider. Proofs of retrievability, first formalized by Juels and Kaliski in [JK07] address this problem by allowing for ...file from a server that makes a client ... See full document
24
A comparison of worst case performance of priority queues used in Dijkstra's shortest path algorithm
... 5.2 Worst Case Graph In order to ensure the maximum possible number of decreasekey operations and worst case time for a decreasekey operation on each data structure it was necessary to f[r] ... See full document
49
How to Fake Auxiliary Input
... this work is to simplify the security proofs of leakage-resilient [10,20,7] and other cryptosystems [12] whose security proofs rely on chain rules for computational entropy (as discussed in the ... See full document
22
CCG Parsing Algorithm with Incremental Tree Rotation
... constructed from right-branching CCGbank ...operation from the top node of the CCGbank tree because that tree does not satisfy the assumption of the algorithm: immediate children are not “perfect” (here ... See full document
12
Modelling of the parametric yield in decananometer SRAM-Arrays
... The Worst Case Distance simulations are much faster than a comparable number of Monte Carlo ...The Worst Case Distance simulations need about 2 min of time on a comparable ...the Worst ... See full document
5
The Performance of ECC Algorithms in DNSSEC: A Model based Approach
... Re-signing and key rollover A regular practice in DNSSEC zone maintenance is zone re- signing and key rollovers. As mentioned before, each DNS RR set has a TTL, which specifies how long it should be cached by ... See full document
88
Worst Case Synchronous Grammar Rules
... Because each variable appears as an argument of only two factors, the junction tree nodes in which it is present form a linear path from one leaf of the tree to another. Since each variable is associated only with ... See full document
8
Related subjects