Viet Tung Hoang
Artificial Intelligence · 2010–2013
A researcher in the Science corpus: 3 papers; trusts 15 researchers and is trusted by 32 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 31 citations into it; #5,261 of 35,345 by trust here, #9,641 by citations
- Computational Theory and Mathematics — 17 citations into it
- Privacy & Security — 12 citations into it
- Computer Vision and Pattern Recognition — 7 citations into it; #6,164 of 21,575 by trust here, #9,079 by citations
- Computer Networks and Communications — 5 citations into it
Whom Viet Tung Hoang trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Yehuda Lindell
- Ilya Mironov
- Benny Pinkas
- Mihir Bellare
- David Canright
- Michael Luby
- Phillip Rogaway
- Donald Beaver
- Ben Kreuter
- Silvio Micali
Who trusts Viet Tung Hoang overall
- Payman Mohassel
- Samee Zahur
- Thomas Ristenpart
- Mike Rosulek
- David E. Evans
- Ebrahim M. Songhori
- M. Sadegh Riazi
- Xiao Shaun Wang
- Thomas Schneider
- Marcel Keller
Papers from Viet Tung Hoang's perspective
Ordered by how strongly the researchers Viet Tung Hoang trusts endorse each paper. Same corpus, a different order for every researcher.
- Random oracles are practical: a paradigm for designing efficient protocols
- Fair exchange with a semi-trusted third party (extended abstract)
- Protocols for secure computations
- Fairplay - Secure Two-Party Computation System
- Secure Two-Party Computation is Practical
- Probabilistic Encryption
- FairplayMP: a system for secure multi-party computation
- Privacy preserving auctions and mechanism design
- The round complexity of secure protocols
- Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
Their papers
- Efficient Garbling from a Fixed-Key Blockcipher (2013) — 355 citations
- Foundations of garbled circuits (2012) — 620 citations
- On Generalized Feistel Networks (2010) — 206 citations