Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 24 for “"Interactive proofs"”.
-
Leveraging Parallelism in Interactive Proofs
Interactive proof systems enable one party (the prover) to convince another (the verifier) of the validity of some computational statement, and ensure that the verifier will be convinced if and only if the statement is true. Since their introduction, interactive proofs have become one of the most …
-
Zero-Knowledge Multi-Prover Interactive Proofs
Single-prover interactive proofs can recognize PSPACE; if certain complexity assumptions are made, they can do so in zero-knowledge. Generalizing to multiple non-communicating provers extends this class to NEXP, and at the same time removes the complexity assumption needed for zero-knowledge. …
-
Non-Interactive Proofs: What Assumptions Are Sufficient?
A non-Interactive proof system allows a prover to convince a verifier that a statement is true by sending a single round of messages. In this thesis, we study under what assumptions can we build non-interactive proof systems with succinct verification and zero-knowledge. We obtain the following …
-
Time and space efficiency of codes and proofs
… space are fundamental measures of complexity. Interactive proofs, PCPs, and error correcting codes are important tools. Error correcting codes have applications from transmitting data through unreliable channels to hardness amplification. Interactive proofs and PCPs have applications from …
-
IOPs to SNARKs: Security from Practice to Theory
Interactive Oracle Proofs (IOPs) are a powerful proof system model that combines features of probabilistically checkable proofs and interactive proofs. While IOPs have enabled remarkable advances in zero-knowledge proofs, verifiable computation, and other cryptographic applications, their security …
-
Contamination in Cryptographic Protocols
We discuss a foundational issue in multi-prover interactive proofs (MIP) which we call "contamination" by the verifier. We propose a model which accounts for, and controls, verifier contamination, and show that this model does not lose expressive power. A new characterization of zero-knowledge …
-
Representing processes as Update Automata and Transducers
… of processes, including database networks, interactive proofs, finite-state transducers, and financial ledgers. We produce a novel solution method and associated transducers for finite systems of arbitrary-order non-homogeneous linear difference equations over a field using Hermite's …
-
Concentration Bounds from Parallel Repetition Theorems
… bounds for nonlocal games and quantum interactive proofs. We make the following contributions: - A lemma that is useful for converting parallel repetition theorems (bounds on the probability of winning all instances of a nonlocal game which is being repeated in parallel) into …
-
Automatizuotos taktikos Coq aplinkoje /
This thesis describes the interactive theorem prover Coq, including its logical foundation and standard proof methods. The study aims to explore and practically apply existing capabilities to better automation and readability of proofs by creating new tactics using the Ltac language. New tactics …
-
Quantum State and Unitary Complexity
… of these bounds are tight. • We define models of interactive proofs for constructing states and implementing unitaries with the help of an untrusted prover. We prove a quantum state analogue of the inclusion PSPACE ⊆ QIP, and obtain somewhat analogous results for unitaries and with multiple …
-
RELATIVISTIC QUANTUM CRYPTOGRAPHY
… models and its applications in the context of interactive proofs and cryptography. We propose bit commitment protocols whose security hinges on communication constraints and investigate its limitations. We explain how some non-communicating models can be justified by special relativity and …
-
Three Results in Quantum Physics
… of quantum information science, Quantum Prover Interactive Proofs, and a highly practical area of quantum information science, error characterization. Previously unnoticed links are drawn between these fields with the intention that further research can provide fertile ground for both to flourish.
-
Clustering Web Users by Mouse Movement to Detect Bots and Botnet Attacks
… the user (user friction) with human interactive proofs (HIP) such as CAPTCHA, or with login requirements
-
Parallel Repetition of Prover-Verifier Quantum Interactions
… to the study of error reduction for quantum interactive proofs using parallel repetition.
-
Implementing a GasefficientSuperlight Bitcoin Client in Solidity
… Αποδείξεις Απόδειξης Εργασίας (Non-Interactive Proofs of Proof of Work - NIPoPoWs), μια πιθανοτική κατασκευή που βασίζεται στην λογική των superblock, είναι αποδεδειγμένα ασφαλής και παρέχει αποδείξεις γεγονότων σε ένα Blockchain που είναι σύντομες και περιεκτικές. Συγκεκριμένα, …
-
Decentralized Blockchain interoperability
… sources, the NIPoPoWs primitive (Non-Interactive Proofs of Proof-of-Work) allows compressing proof-of-work into succinct strings that shrink a long blockchain into a succinct polylogarithmic proof. We provide the first ATMS and NIPoPoWs constructions. For work, we prove our …
-
Key Exchange and Zero-Knowledge Proofs from Isogenies and Hyperelliptic Curves
… primary focus of this thesis: zero-knowledge proofs. As suggested by the name, such schemes allow a statement to be proved without leaking any information other than the validity of the statement. We propose a zero-knowledge proof protocol that fixes a flaw in the security proof of the De …
-
How to Provably Leverage Time in Cryptography
… of the Fiat-Shamir heuristic for constant round proofs. Finally, we study tradeoffs in the complexity of proofs for the repeated squaring relation, which are one of the main tools used in practical time-based cryptographic applications.We consider non-interactive proofs for the relation …
-
Εφαρμοσμένη επιχειρησιακή έρευνα στην πληροφορική: παιγνιοθεωρητικά υποδείγματα για δίκτυα χρηστών του διαδικτύου
… to include the possibility of employing Human Interactive Proofs (HIPs), in conjunction with anti-spam filters. The analysis shows that making relatively cheap HIPs widely available to the community of e-mail users, reduces the volume of spam on the internet and increases the benefit that …
-
New results on verifiable and differentially private data analysis
… of distribution-testing problems, we construct interactive protocols in which a verifier uses only a small number of samples from the distribution and pairwise conditional-sampling queries, even though solving the same testing problem from scratch requires exponentially more samples and queries. …
Page 1 of 2