• Publications
  • Influence
On the security of public key protocols
  • D. Dolev, A. Yao
  • Computer Science
  • 22nd Annual Symposium on Foundations of Computer…
  • 1 March 1983
TLDR
Several models are formulated in which the security of protocols can be discussed precisely, and algorithms and characterizations that can be used to determine protocol security in these models are given. Expand
Protocols for secure computations
  • A. Yao
  • Computer Science
  • FOCS
  • 3 November 1982
TLDR
This paper describes three ways of solving the millionaires’ problem by use of one-way functions (i.e., functions which are easy to evaluate but hard to invert) and discusses the complexity question “How many bits need to be exchanged for the computation”. Expand
How to generate and exchange secrets
  • A. Yao
  • 27th Annual Symposium on Foundations of Computer…
  • 1986
In this paper we introduce a new tool for controlling the knowledge transfer process in cryptographic protocol design. It is applied to solve a general class of problems which include most of theExpand
How to Generate and Exchange Secrets (Extended Abstract)
  • A. Yao
  • Computer Science
  • FOCS
  • 27 October 1986
TLDR
A new tool for controlling the knowledge transfer process in cryptographic protocol design is introduced and it is applied to solve a general class of problems which include most of the two-party cryptographic problems in the literature. Expand
Probabilistic computations: Toward a unified measure of complexity
  • A. Yao
  • Computer Science
  • 18th Annual Symposium on Foundations of Computer…
  • 30 September 1977
TLDR
Two approaches to the study of expected running time of algoritruns lead naturally to two different definitions of intrinsic complexity of a problem, which are the distributional complexity and the randomized complexity, respectively. Expand
Protocols for Secure Computations (extended abstract)
  • A. Yao
  • Computer Science
  • FOCS
  • 1982
Theory and application of trapdoor functions
  • A. Yao
  • Computer Science
  • 23rd Annual Symposium on Foundations of Computer…
  • 3 November 1982
TLDR
A new information theory is introduced and the concept of trapdoor functions is studied and applications of such functions in cryptography, pseudorandom number generation, and abstract complexity theory are examined. Expand
Some complexity questions related to distributive computing(Preliminary Report)
  • A. Yao
  • Computer Science, Mathematics
  • STOC
  • 30 April 1979
TLDR
The quantity of interest, which measures the information exchange necessary for computing f, is the minimum number of bits exchanged in any algorithm. Expand
Quantum Circuit Complexity
  • A. Yao
  • Mathematics, Computer Science
  • FOCS
  • 3 November 1993
TLDR
It is shown that any function computable in polynomial time by a quantum Turing machine has aPolynomial-size quantum circuit, and this result enables us to construct a universal quantum computer which can simulate a broader class of quantum machines than that considered by E. Bernstein and U. Vazirani (1993), thus answering an open question raised by them. Expand
...
1
2
3
4
5
...