Serviceeinschränkungen vom 12.-22.02.2026 - weitere Infos auf der UB-Homepage

Treffer: Proofs Probable.

Title:
Proofs Probable.
Authors:
Source:
Communications of the ACM; Jun2013, Vol. 56 Issue 6, p22-24, 3p, 3 Color Photographs
Database:
Complementary Index

Weitere Informationen

The article presents an overview of the research of 2012 Association for Computing Machinery (ACM) A.M. Turing Award winning computer scientists Shafi Goldwasser and Silvio Micali in the field of cryptography, with particular focus on their work on interactive and zero-knowledge proofs. It is noted that their 1983 research paper “Probabilistic Encryption," was one of the first studies to define concepts of data security and encryption. Their interactive proof method, developed with computer scientist Charles Rackoff, demonstrates how to prove a theorem without requiring the other person to understand how to prove the theorem, while their zero-knowledge proofs show how a person can be convinced of the correctness of information without knowing that information.