Faster access than browser!
56 relations: Amit Sahai, Arrow information paradox, Authentication, Avi Wigderson, Bitcoin, Blum integer, Charles Rackoff, Co-NP, Commitment scheme, Complement (complexity), Computational indistinguishability, Cryptographic hash function, Cryptographic protocol, Cryptography, Cynthia Dwork, Discrete logarithm, Ethereum, Feige–Fiat–Shamir identification scheme, Gödel Prize, Graph (discrete mathematics), Graph coloring, Graph isomorphism, Graph isomorphism problem, Group theory, Hamiltonian path, Interactive proof system, Jean-Jacques Quisquater, László Babai, Moni Naor, Moti Yung, Negligible function, Non-interactive zero-knowledge proof, NP (complexity), NP-completeness, Oded Goldreich, One-time pad, One-way function, Outline of cryptography, PP (complexity), Prime number, Probabilistic Turing machine, Proof of knowledge, Pseudorandom number generator, Quadratic residue, Russell Impagliazzo, Salil Vadhan, Scott Aaronson, Shafi Goldwasser, Shlomo Moran, Silvio Micali, ..., Society for Industrial and Applied Mathematics, Statistically close, Turing machine, Where's Wally?, Witness-indistinguishable proof, Zero-knowledge password proof. Expand index (6 more) »
Amit Sahai
Amit Sahai (अमित सहाय; born 1974) is an American computer scientist.
New!!: Zero-knowledge proof and Amit Sahai · See more »
Arrow information paradox
The Arrow information paradox (information paradox for short or AIP), and occasionally referred to as Arrow's disclosure paradox.
New!!: Zero-knowledge proof and Arrow information paradox · See more »
Authentication
Authentication (from authentikos, "real, genuine", from αὐθέντης authentes, "author") is the act of confirming the truth of an attribute of a single piece of data claimed true by an entity.
New!!: Zero-knowledge proof and Authentication · See more »
Avi Wigderson
Avi Wigderson (אבי ויגדרזון; born 9 September 1956) is an Israeli mathematician and computer scientist.
New!!: Zero-knowledge proof and Avi Wigderson · See more »
Bitcoin
Bitcoin (₿) is the world's first cryptocurrency, a form of electronic cash.
New!!: Zero-knowledge proof and Bitcoin · See more »
Blum integer
In mathematics, a natural number n is a Blum integer if n.
New!!: Zero-knowledge proof and Blum integer · See more »
Charles Rackoff
Charles Weill Rackoff is an American cryptologist.
New!!: Zero-knowledge proof and Charles Rackoff · See more »
Co-NP
In computational complexity theory, co-NP is a complexity class.
New!!: Zero-knowledge proof and Co-NP · See more »
Commitment scheme
A commitment scheme is a cryptographic primitive that allows one to commit to a chosen value (or chosen statement) while keeping it hidden to others, with the ability to reveal the committed value later.
New!!: Zero-knowledge proof and Commitment scheme · See more »
Complement (complexity)
In computational complexity theory, the complement of a decision problem is the decision problem resulting from reversing the yes and no answers.
New!!: Zero-knowledge proof and Complement (complexity) · See more »
Computational indistinguishability
In computational complexity, if \scriptstyle\_ and \scriptstyle\_ are two distribution ensembles indexed by a security parameter n (which usually refers to the length of the input), then we say they are computationally indistinguishable if for any non-uniform probabilistic polynomial time algorithm A, the following quantity is a negligible function in n: denoted D_n \approx E_n.
New!!: Zero-knowledge proof and Computational indistinguishability · See more »
Cryptographic hash function
A cryptographic hash function is a special class of hash function that has certain properties which make it suitable for use in cryptography.
New!!: Zero-knowledge proof and Cryptographic hash function · See more »
Cryptographic protocol
A security protocol (cryptographic protocol or encryption protocol) is an abstract or concrete protocol that performs a security-related function and applies cryptographic methods, often as sequences of cryptographic primitives.
New!!: Zero-knowledge proof and Cryptographic protocol · See more »
Cryptography
Cryptography or cryptology (from κρυπτός|translit.
New!!: Zero-knowledge proof and Cryptography · See more »
Cynthia Dwork
Cynthia Dwork (born 1958) is an American computer scientist at Harvard University, where she is Gordon McKay Professor of Computer Science, Radcliffe Alumnae Professor at the Radcliffe Institute for Advanced Study, and Affiliated Professor, Harvard Law School.
New!!: Zero-knowledge proof and Cynthia Dwork · See more »
Discrete logarithm
In the mathematics of the real numbers, the logarithm logb a is a number x such that, for given numbers a and b. Analogously, in any group G, powers bk can be defined for all integers k, and the discrete logarithm logb a is an integer k such that.
New!!: Zero-knowledge proof and Discrete logarithm · See more »
Ethereum
Ethereum is an open-source, public, blockchain-based distributed computing platform and operating system featuring smart contract (scripting) functionality.
New!!: Zero-knowledge proof and Ethereum · See more »
Feige–Fiat–Shamir identification scheme
In cryptography, the Feige–Fiat–Shamir identification scheme is a type of parallel zero-knowledge proof developed by Uriel Feige, Amos Fiat, and Adi Shamir in 1988.
New!!: Zero-knowledge proof and Feige–Fiat–Shamir identification scheme · See more »
Gödel Prize
The Gödel Prize is an annual prize for outstanding papers in the area of theoretical computer science, given jointly by European Association for Theoretical Computer Science (EATCS) and the Association for Computing Machinery Special Interest Group on Algorithms and Computational Theory (ACM SIGACT).
New!!: Zero-knowledge proof and Gödel Prize · See more »
Graph (discrete mathematics)
In mathematics, and more specifically in graph theory, a graph is a structure amounting to a set of objects in which some pairs of the objects are in some sense "related".
New!!: Zero-knowledge proof and Graph (discrete mathematics) · See more »
Graph coloring
In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called "colors" to elements of a graph subject to certain constraints.
New!!: Zero-knowledge proof and Graph coloring · See more »
Graph isomorphism
In graph theory, an isomorphism of graphs G and H is a bijection between the vertex sets of G and H such that any two vertices u and v of G are adjacent in G if and only if ƒ(u) and ƒ(v) are adjacent in H. This kind of bijection is commonly described as "edge-preserving bijection", in accordance with the general notion of isomorphism being a structure-preserving bijection.
New!!: Zero-knowledge proof and Graph isomorphism · See more »
Graph isomorphism problem
The graph isomorphism problem is the computational problem of determining whether two finite graphs are isomorphic.
New!!: Zero-knowledge proof and Graph isomorphism problem · See more »
Group theory
In mathematics and abstract algebra, group theory studies the algebraic structures known as groups.
New!!: Zero-knowledge proof and Group theory · See more »
Hamiltonian path
In the mathematical field of graph theory, a Hamiltonian path (or traceable path) is a path in an undirected or directed graph that visits each vertex exactly once.
New!!: Zero-knowledge proof and Hamiltonian path · See more »
Interactive proof system
In computational complexity theory, an interactive proof system is an abstract machine that models computation as the exchange of messages between two parties.
New!!: Zero-knowledge proof and Interactive proof system · See more »
Jean-Jacques Quisquater
Jean-Jacques Quisquater (born 13 January 1945) is a cryptographer and a professor at Université catholique de Louvain.
New!!: Zero-knowledge proof and Jean-Jacques Quisquater · See more »
László Babai
László "Laci" Babai (born July 20, 1950 in Budapest) from Babai's web site, retrieved 2016-01-28.
New!!: Zero-knowledge proof and László Babai · See more »
Moni Naor
Moni Naor (מוני נאור) is an Israeli computer scientist, currently a professor at the Weizmann Institute of Science.
New!!: Zero-knowledge proof and Moni Naor · See more »
Moti Yung
Mordechai M. (Moti) Yung is an Israeli-American cryptographer and computer scientist with an extensive industrial research career.
New!!: Zero-knowledge proof and Moti Yung · See more »
Negligible function
In mathematics, a negligible function is a function \mu:\mathbb\to\mathbb such that for every positive integer c there exists an integer Nc such that for all x > Nc, Equivalently, we may also use the following definition.
New!!: Zero-knowledge proof and Negligible function · See more »
Non-interactive zero-knowledge proof
Non-interactive zero-knowledge proofs are a variant of zero-knowledge proofs in which no interaction is necessary between prover and verifier.
New!!: Zero-knowledge proof and Non-interactive zero-knowledge proof · See more »
NP (complexity)
In computational complexity theory, NP (for nondeterministic polynomial time) is a complexity class used to describe certain types of decision problems.
New!!: Zero-knowledge proof and NP (complexity) · See more »
NP-completeness
In computational complexity theory, an NP-complete decision problem is one belonging to both the NP and the NP-hard complexity classes.
New!!: Zero-knowledge proof and NP-completeness · See more »
Oded Goldreich
Oded Goldreich (עודד גולדרייך; b. 1957) is a professor of Computer Science at the Faculty of Mathematics and Computer Science of Weizmann Institute of Science, Israel.
New!!: Zero-knowledge proof and Oded Goldreich · See more »
One-time pad
In cryptography, the one-time pad (OTP) is an encryption technique that cannot be cracked, but requires the use of a one-time pre-shared key the same size as, or longer than, the message being sent.
New!!: Zero-knowledge proof and One-time pad · See more »
One-way function
In computer science, a one-way function is a function that is easy to compute on every input, but hard to invert given the image of a random input.
New!!: Zero-knowledge proof and One-way function · See more »
Outline of cryptography
The following outline is provided as an overview of and topical guide to cryptography: Cryptography (or cryptology) – practice and study of hiding information.
New!!: Zero-knowledge proof and Outline of cryptography · See more »
PP (complexity)
In complexity theory, PP is the class of decision problems solvable by a probabilistic Turing machine in polynomial time, with an error probability of less than 1/2 for all instances.
New!!: Zero-knowledge proof and PP (complexity) · See more »
Prime number
A prime number (or a prime) is a natural number greater than 1 that cannot be formed by multiplying two smaller natural numbers.
New!!: Zero-knowledge proof and Prime number · See more »
Probabilistic Turing machine
In computability theory, a probabilistic Turing machine is a non-deterministic Turing machine which chooses between the available transitions at each point according to some probability distribution.
New!!: Zero-knowledge proof and Probabilistic Turing machine · See more »
Proof of knowledge
In cryptography, a proof of knowledge is an interactive proof in which the prover succeeds in 'convincing' a verifier that the prover knows something.
New!!: Zero-knowledge proof and Proof of knowledge · See more »
Pseudorandom number generator
A pseudorandom number generator (PRNG), also known as a deterministic random bit generator (DRBG), is an algorithm for generating a sequence of numbers whose properties approximate the properties of sequences of random numbers.
New!!: Zero-knowledge proof and Pseudorandom number generator · See more »
Quadratic residue
In number theory, an integer q is called a quadratic residue modulo n if it is congruent to a perfect square modulo n; i.e., if there exists an integer x such that: Otherwise, q is called a quadratic nonresidue modulo n. Originally an abstract mathematical concept from the branch of number theory known as modular arithmetic, quadratic residues are now used in applications ranging from acoustical engineering to cryptography and the factoring of large numbers.
New!!: Zero-knowledge proof and Quadratic residue · See more »
Russell Impagliazzo
Russell Impagliazzo is a professor of computer science at the University of California, San Diego.
New!!: Zero-knowledge proof and Russell Impagliazzo · See more »
Salil Vadhan
Salil Vadhan is Vicky Joseph Professor of Computer Science and Applied Mathematics at Harvard University.
New!!: Zero-knowledge proof and Salil Vadhan · See more »
Scott Aaronson
Scott Joel Aaronson (born May 21, 1981) is an American theoretical computer scientist and David J. Bruton Jr.
New!!: Zero-knowledge proof and Scott Aaronson · See more »
Shafi Goldwasser
Shafrira Goldwasser (שפרירה גולדווסר; born 1959) is an American-Israeli computer scientist and winner of the Turing Award in 2012.
New!!: Zero-knowledge proof and Shafi Goldwasser · See more »
Shlomo Moran
Shlomo Moran (שלמה מורן; born 1947) is an Israeli computer scientist, the Bernard Elkin Chair in Computer Science at the Technion – Israel Institute of Technology in Haifa, Israel.
New!!: Zero-knowledge proof and Shlomo Moran · See more »
Silvio Micali
Silvio Micali (born October 13, 1954) is an Italian computer scientist at MIT Computer Science and Artificial Intelligence Laboratory and a professor of computer science in MIT's Department of Electrical Engineering and Computer Science since 1983.
New!!: Zero-knowledge proof and Silvio Micali · See more »
Society for Industrial and Applied Mathematics
The Society for Industrial and Applied Mathematics (SIAM) is an academic association dedicated to the use of mathematics in industry.
New!!: Zero-knowledge proof and Society for Industrial and Applied Mathematics · See more »
Statistically close
The variation distance of two distributions X and Y over a finite domain D, (often referred to as statistical difference or statistical distance in cryptography) is defined as \Delta(X,Y).
New!!: Zero-knowledge proof and Statistically close · See more »
Turing machine
A Turing machine is a mathematical model of computation that defines an abstract machine, which manipulates symbols on a strip of tape according to a table of rules.
New!!: Zero-knowledge proof and Turing machine · See more »
Where's Wally?
Where's Wally?, published in the US and Canada as Where's Waldo?, is a British series of children's puzzle books created by English illustrator Martin Handford.
New!!: Zero-knowledge proof and Where's Wally? · See more »
Witness-indistinguishable proof
A witness-indistinguishable proof (WIP) is a variant of a zero-knowledge proof for languages in NP.
New!!: Zero-knowledge proof and Witness-indistinguishable proof · See more »
Zero-knowledge password proof
In cryptography, a zero-knowledge password proof (ZKPP) is an interactive method for one party (the prover) to prove to another party (the verifier) that it knows a value of a password, without revealing anything other than the fact that it knows that password to the verifier.
New!!: Zero-knowledge proof and Zero-knowledge password proof · See more »
Redirects here:
ZKIP, ZKP, Zero knowledge proof, Zero knowledge proofs, Zero-knowledge proofs, Zero-knowledge protocol, Zk proof.
References
[1] https://en.wikipedia.org/wiki/Zero-knowledge_proof
