Magic Functions: In Memoriam: Bernard M. Dwork 1923--1998

@article{Dwork1999MagicFI,
  title={Magic Functions: In Memoriam: Bernard M. Dwork 1923--1998},
  author={Cynthia Dwork and Moni Naor and Omer Reingold and Larry J. Stockmeyer},
  journal={J. ACM},
  year={1999},
  volume={50},
  pages={852-921}
}
We prove that three apparently unrelated fundamental problems in distributed computing, cryptography, and complexity theory, are essentially the same problem. These three problems and brief descriptions of them follow. (1) The selective decommitment problem. An adversary is given commitments to a collection of messages, and the adversary can ask for some subset of the commitments to be opened. The question is whether seeing the decommitments to these open plaintexts allows the adversary to… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
SHOWING 1-7 OF 7 REFERENCES

On the Composition of Zero-Knowledge Proof Systems

VIEW 22 EXCERPTS
HIGHLY INFLUENTIAL

How to prove yourself: Practical solutions to identi cation and sig- nature problems

  • A. Fiat, A. Shamir
  • Proc. CRYPTO'86, Lecture Notes in Computer Science, Vol. 263, Springer- Verlag
  • 1987
VIEW 39 EXCERPTS
HIGHLY INFLUENTIAL

Probabilistic Encryption

VIEW 10 EXCERPTS
HIGHLY INFLUENTIAL

and C

  • J. Kilian, E. Petrank
  • Racko , Lower bounds for zero knowledge on the internet, Proc. 39th IEEE Symp. on Foundations of Computer Science
  • 1998
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

Hard-core distributions for somewhat hard problems

  • Russell Impagliazzo
  • Mathematics, Computer Science
  • Proceedings of IEEE 36th Annual Foundations of Computer Science
  • 1995
VIEW 12 EXCERPTS
HIGHLY INFLUENTIAL

A uniform-complexity treatment of encryption and zero-knowledge

VIEW 10 EXCERPTS
HIGHLY INFLUENTIAL