C. Rangan
2000
A researcher in the Science corpus: 1 paper; trusts 4 researchers and is trusted by 0 researchers here, as inferred from the citation graph.
Whom C. Rangan trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Papers from C. Rangan's perspective
Ordered by how strongly the researchers C. Rangan trusts endorse each paper. Same corpus, a different order for every researcher.
- How to share a secret
- How to play ANY mental game
- Completeness theorems for non-cryptographic fault-tolerant distributed computation
- Protocols for secure computations
- IP = PSPACE
- Probabilistic Encryption
- A method for obtaining digital signatures and public-key cryptosystems
- The Knowledge Complexity of Interactive Proof Systems
- New Directions in Cryptography
- Checking computations in polylogarithmic time
Their papers
- Efficient Asynchronous Secure Multiparty Distributed Computation (2000) — 41 citations