Why GKR and not other Interactive Proofs?
A hierarchy theorem for interactive proofs of proximity
... an interactive-proof for L MOD3 with a linear-time verifier is trivial, since the verifier can decide membership by itself in ...the GKR protocol is that it allows for sublinear time verification given ...
43
Practical Verified Computation with Streaming Interactive Proofs
... reported speedups relative to sequential processing take this cost into account. We do not count the time to allocate memory for scratch space because this can be done in advance. We ran our GPU-based implementation of ...
288
Interactive Coding for Interactive Proofs
... of interactive proofs, it is not enough to ensure that an honest party “eventually” learns the real message the other party was attempting to ...by interactive coding protocols, which enable ...
12
Non-Locality in Interactive Proofs
... Second, the non-locality of simulators is a characterization of the resilience of zero-knowledge. A protocol with local simulators which can withstand arbitrary (malicious) verifiers is more resilient than one in which ...
26
Non-Interactive Proofs for Integer Multiplication
... reason why the dealer must resolve conflicts in the protocol by Abe et ...the other hand, a typical implementation would realize the channels using public-key encryption, so we propose to include this ...
20
Interactive Proofs under Continual Memory Leakage
... In other words, it is still possible to have a standard simulation based notion where the encodings are completely ...non interactive zero knowledge proof that the instance belongs to that language and then ...
58
Constant-Round Interactive Proofs for Delegating Computation
... is also why our soundness argument applies to UP statement, but does not extend to general NP statements. Remark 2.3. [Many inputs not in L] We assumed throughout that there was only a single j ∗ ∈ [k] for which x ...
97
Non-Interactive Zero-Knowledge Proofs of Non-Membership
... We are going to work on SPHF-friendly languages. Recent works have drastically increased the range of languages manageable with SPHF (e.g. [BBC + 13a,BBC + 13b]), to every kind of pairing product equations over graded ...
18
Effective Interactive Proofs for Higher-Order Imperative Programs
... We achieve type safety through the representation invariant. Definition rep (s : stack) (ls : list T) : hprop := Exists po :@ option ptr, s --> po * listRep ls po. Before we start implementing the ADT methods, we ...
13
Why "Fiat-Shamir for Proofs" Lacks a Proof
... Adv A G (n) def = Pr[ (A n Γ(1 n )) = 1 ] − c . A cryptographic game G is secure if for all polysizeattackers A = {A n }, the advantage Adv A G (n) is negligible. When c = 0, the above definition of cryptographic games ...
20
Non-Malleable Multi-Prover Interactive Proofs and Witness Signatures
... Our impossibility result holds even in the weaker stateful token model where a malicious adversary is not allowed to encapsulate tokens, and even if honest parties can create stateful tokens implementing arbitrary ...
40
Phish and HIPs: Human Interactive Proofs to Detect Phishing Attacks
... Third Party Seals. Third party seal programs allow one party to certify an- other party and offer a “seal of approval” that represents this certification. For example, Verisign allows parties that have purchased a ...
15
Succinct Arguments from Multi-Prover Interactive Proofs and their Efficiency Benefits
... In other words, provers do not have to write down long proofs, but only answer specific questions of the verifier, which amounts to just a few evaluations of certain ...long proofs and relatively ...
72
A Combination of a Dynamic Geometry Software With a Proof Assistant for Interactive Formal Proofs
... Once a diagram is completely constructed, users easily see free points that do not depend on other constructions as these points are highlighted using a different color. Users can move these free points by ...
13
Interactive Proofs for $\mathsf{BQP}$ via Self-Tested Graph States
... It is important to consider the view of a single prover during the protocol. They will receive one of four measurement settings, all of which appear in the test for honesty, but not all will necessarily appear as part of ...
42
Minimizing Non-interactive Zero-Knowledge Proofs Using Fully Homomorphic Encryption
... under other assumptions [SV10, vDGHV10, ...NIZK proofs though. However, if NIZK proofs do exist then fully homomorphic encryption can be used to reduce the size of the ...NIZK proofs where the ...
14
Explanatory Proofs and Beautiful Proofs
... two proofs of the same theorem di↵er (according to a mathematician) in explanatory ...these proofs that is responsible for their di↵erence in explanatory ...these proofs is explanatory because it ...
46
Glitch-Resistant Masking Revisited - or Why Proofs in the Robust Probing Model are Needed
... Due to the absence of this register stage, the just presented composability issues of the DOM-indep multiplication would arise, rendering the whole construction insecure. Adding such a register stage would on the one ...
41
Non interactive proofs of proximity
... First, notice that if k depends on ε, then the proof string in Theorem 6.2 becomes dependent on ε too, and therefore this protocol does not fall in our definition of MAP (Definition 2.1), which requires a single proof of ...
70
Interactive and zero-knowledge proofs
... Interactive and zero-knowledge proofs Molli Noland Follow this and additional works at: http://scholarworks.rit.edu/theses This Thesis is brought to you for free and open access by the Thesis/Dissertation ...
117