Computer Science – Computational Complexity
Scientific paper
2009-08-18
Computer Science
Computational Complexity
38 pages, 4 figures
Scientific paper
Knowledge extraction is a fundamental notion, modelling machine possession of values (witnesses) in a computational complexity sense. The notion provides an essential tool for cryptographic protocol design and analysis, enabling one to argue about the internal state of protocol players without ever looking at this supposedly secret state. However, when transactions are concurrent (e.g., over the Internet) with players possessing public-keys (as is common in cryptography), assuring that entities ``know'' what they claim to know, where adversaries may be well coordinated across different transactions, turns out to be much more subtle and in need of re-examination. Here, we investigate how to formally treat knowledge possession by parties (with registered public-keys) interacting over the Internet. Stated more technically, we look into the relative power of the notion of ``concurrent knowledge-extraction'' (CKE) in the concurrent zero-knowledge (CZK) bare public-key (BPK) model.
Yao Andrew C.
Yung Moti
Zhao Yunlei
No associations
LandOfFree
Concurrent Knowledge-Extraction in the Public-Key Model does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Concurrent Knowledge-Extraction in the Public-Key Model, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Concurrent Knowledge-Extraction in the Public-Key Model will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-8141