Arguments - PDFSEARCH.IO - Document Search Engine

Arguments
Results: 5088

#	Item
1	On the Size of Pairing-based Non-interactive Arguments? Jens Groth?? University College London, UK Abstract. Non-interactive arguments enable a prover to convince a verifier that a statement is true. R Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2016-05-31 08:55:32 Algebra Mathematics Multilinear algebra Non-interactive zero-knowledge proof Proof theory IP Snark Zero-knowledge proof Zero knowledge Soundness Bilinear map Model theory
2	COSC 544 Probabilistic Proof SystemsLinear PCPs and Succinct Arguments Lecturer: Justin Thaler Add to Reading List Source URL: people.cs.georgetown.edu Language: English - Date: 2017-10-26 08:54:48 Randomized algorithms Probabilistically checkable proof Mathematics IP Cryptography Creativity NP Soundness Proof of secure erasure Cryptographic protocol Interactive proof system
3	Keyword and Optional Arguments in PLT Scheme Matthew Flatt Eli Barzilay University of Utah and PLT Add to Reading List Source URL: www.cs.utah.edu Language: English - Date: 2009-07-29 15:35:55 Software engineering Computer programming Computing Programming languages Object-oriented programming languages Functional programming Procedural programming languages Subroutines Scheme Parameter Lisp Anonymous function
4	Ligero: Lightweight Sublinear Arguments Without a Trusted Setup Add to Reading List Source URL: acmccs.github.io Language: English - Date: 2017-12-30 21:51:58
5	Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting†∗ Jonathan Bootle1 , Andrea Cerulli1 , Pyrros Chaidos1∗∗ , Jens Groth1 , and Christophe Petit2 1 Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2016-03-08 12:29:47 Cryptography Computational complexity theory Complexity classes Randomized algorithms Zero-knowledge proof Analysis of algorithms NP Commitment scheme Probabilistically checkable proof IP Logarithm XTR
6	COSC 544 Probabilistic Proof SystemsPCPs and Succinct Arguments Lecturer: Justin Thaler Add to Reading List Source URL: people.cs.georgetown.edu Language: English - Date: 2017-10-25 19:33:50 Cryptography Computational complexity theory Complexity classes Randomized algorithms Probabilistically checkable proof IP NP Zero-knowledge proof Soundness Interactive proof system Zero knowledge Commitment scheme
7	COSC 544 Probabilistic Proof SystemsInteractive Proofs & Arguments, Low-Degree & Multilinear Extensions Lecturer: Justin Thaler Add to Reading List Source URL: people.cs.georgetown.edu Language: English - Date: 2017-09-18 21:24:56 Mathematics Computational complexity theory Algebra Polynomials Randomized algorithms Complexity classes IP Interactive proof system NP ArthurMerlin protocol SchwartzZippel lemma Soundness
8	Disclaimer This work is published under the responsibility of the Secretary-General of the OECD. The opinions expressed and the arguments employed herein do not necessarily reflect the official views of OECD member cou Add to Reading List Source URL: www.oecd.org Language: English - Date: 2016-03-29 12:23:25
9	Embracing Complexity Major Writing Assignment 2: Placing Satrapi’s Persepolis in Context Description: As a class, we have analyzed written and visual arguments (such as ads, film, etc.). One of the hybrid written/vis Add to Reading List Source URL: ideal.uiowa.edu Language: English - Date: 2017-07-20 13:01:24
10	Severin Schroeder, Reading: „Kein Nichts und kein Etwas. Wittgenstein über Empfindungen“ Mein Vortrag wird sich mit Schlüsselpassagen des sogenannten Privatsprachen-Arguments in Wittgensteins Philosophischen Unters Add to Reading List Source URL: www.uni-goettingen.de