default search action
Shien Jin Ong
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
- [j2]Iftach Haitner, Minh-Huyen Nguyen, Shien Jin Ong, Omer Reingold, Salil P. Vadhan:
Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function. SIAM J. Comput. 39(3): 1153-1218 (2009) - [c7]Shien Jin Ong, David C. Parkes, Alon Rosen, Salil P. Vadhan:
Fairness with an Honest Minority and a Rational Majority. TCC 2009: 36-53 - 2008
- [c6]Shien Jin Ong, Salil P. Vadhan:
An Equivalence Between Zero Knowledge and Commitments. TCC 2008: 482-500 - [i9]Shien Jin Ong, David C. Parkes, Alon Rosen, Salil P. Vadhan:
Fairness with an Honest Minority and a Rational Majority. IACR Cryptol. ePrint Arch. 2008: 97 (2008) - 2007
- [j1]Boaz Barak, Shien Jin Ong, Salil P. Vadhan:
Derandomization in Cryptography. SIAM J. Comput. 37(2): 380-400 (2007) - [c5]Shien Jin Ong, Salil P. Vadhan:
Zero Knowledge and Soundness Are Symmetric. EUROCRYPT 2007: 187-209 - 2006
- [c4]Minh-Huyen Nguyen, Shien Jin Ong, Salil P. Vadhan:
Statistical Zero-Knowledge Arguments for NP from Any One-Way Function. FOCS 2006: 3-14 - [c3]Daniele Micciancio
, Shien Jin Ong, Amit Sahai, Salil P. Vadhan:
Concurrent Zero Knowledge Without Complexity Assumptions. TCC 2006: 1-20 - [i8]Minh-Huyen Nguyen, Shien Jin Ong, Salil P. Vadhan:
Statistical Zero-Knowledge Arguments for NP from Any One-Way Function. Electron. Colloquium Comput. Complex. TR06 (2006) - [i7]Shien Jin Ong, Salil P. Vadhan:
Zero Knowledge and Soundness are Symmetric. Electron. Colloquium Comput. Complex. TR06 (2006) - [i6]Minh-Huyen Nguyen, Shien Jin Ong, Salil P. Vadhan:
Statistical Zero-Knowledge Arguments for NP from Any One-Way Function. IACR Cryptol. ePrint Arch. 2006: 185 (2006) - [i5]Shien Jin Ong, Salil P. Vadhan:
Zero Knowledge and Soundness are Symmetric. IACR Cryptol. ePrint Arch. 2006: 414 (2006) - 2005
- [i4]Daniele Micciancio, Shien Jin Ong, Amit Sahai, Salil P. Vadhan:
Concurrent Zero Knowledge without Complexity Assumptions. Electron. Colloquium Comput. Complex. TR05 (2005) - [i3]Boaz Barak, Shien Jin Ong, Salil P. Vadhan:
Derandomization in Cryptography. Electron. Colloquium Comput. Complex. TR05 (2005) - [i2]Daniele Micciancio, Shien Jin Ong, Amit Sahai, Salil P. Vadhan:
Concurrent Zero Knowledge without Complexity Assumptions. IACR Cryptol. ePrint Arch. 2005: 286 (2005) - [i1]Boaz Barak, Shien Jin Ong, Salil P. Vadhan:
Derandomization in Cryptography. IACR Cryptol. ePrint Arch. 2005: 365 (2005) - 2004
- [c2]Yevgeniy Dodis, Shien Jin Ong, Manoj Prabhakaran, Amit Sahai:
On the (Im)possibility of Cryptography with Imperfect Randomness. FOCS 2004: 196-205 - 2003
- [c1]Boaz Barak, Shien Jin Ong, Salil P. Vadhan:
Derandomization in Cryptography. CRYPTO 2003: 299-315
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: