First Page | Document Content | |
---|---|---|
Date: 2010-03-21 22:20:21Cryptography Computational complexity theory Complexity classes Interactive proof system Zero-knowledge proof NP Probabilistically checkable proof IP Soundness Commitment scheme NEXPTIME P versus NP problem | The Complexity of Zero Knowledge Salil Vadhan∗ School of Engineering and Applied Sciences Harvard University Cambridge, MA 02138Add to Reading ListSource URL: people.seas.harvard.eduDownload Document from Source WebsiteFile Size: 202,09 KBShare Document on Facebook |
starting point TCP/IP State Transition Diagram (RFC793) CLOSEDDocID: 1xVUl - View Document | |
Detecting Intentional Packet Drops on the Internet via TCP/IP Side Channels: Extended Version arXiv:1312.5739v1 [cs.NI] 19 Dec 2013DocID: 1xVzb - View Document | |
NTT Global IP Network Configuration Tools Overview! Presented by: Shawn MorrisDocID: 1xVen - View Document | |
Choudhury et al. VOL. 10, NO. 10/OCTOBER 2018/J. OPT. COMMUN. NETW. 1 Two Use Cases of Machine Learning for SDN-Enabled IP/Optical Networks:DocID: 1xUSk - View Document | |
Schweizerischer Verband der Telekommunikation | Association Suisse des Télécommunications | Swiss Telecommunications Association Medienmitteilung Umstellung auf digitale IP-Telefonie – Neuer Leitfaden unterstützt ADocID: 1xTzw - View Document |