List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Bounds on the efficiency of black-box commitment schemes Theoretical Computer Science | 2010-03-10 | Paper |
| Reducing complexity assumptions for statistically-hiding commitment Journal of Cryptology | 2009-06-30 | Paper |
| Universally-Composable Two-Party Computation in Two Rounds Advances in Cryptology - CRYPTO 2007 | 2009-03-10 | Paper |
| Reducing Complexity Assumptions for Statistically-Hiding Commitment Lecture Notes in Computer Science | 2008-05-06 | Paper |
| Advances in Cryptology - CRYPTO 2003 Lecture Notes in Computer Science | 2007-11-28 | Paper |
| Automata, Languages and Programming Lecture Notes in Computer Science | 2006-01-10 | Paper |
Research outcomes over time
This page was built for person: Omer Horvitz
