 | 2012 |
| 25 |  | Yevgeniy Dodis,
Abhishek Jain,
Tal Moran,
Daniel Wichs:
Counterexamples to Hardness Amplification beyond Negligible.
TCC 2012: 476-493 |
| 24 |  | Yevgeniy Dodis,
Abhishek Jain,
Tal Moran,
Daniel Wichs:
Counterexamples to Hardness Amplification Beyond Negligible.
IACR Cryptology ePrint Archive 2012: 32 (2012) |
| 2011 |
| 23 |  | Mohammad Mahmoody,
Tal Moran,
Salil P. Vadhan:
Time-Lock Puzzles in the Random Oracle Model.
CRYPTO 2011: 39-50 |
| 22 |  | Yiling Chen,
Stephen Chong,
Ian A. Kash,
Tal Moran,
Salil P. Vadhan:
Truthful Mechanisms for Agents that Value Privacy
CoRR abs/1111.5472: (2011) |
| 21 |  | Mohammad Mahmoody,
Tal Moran,
Salil P. Vadhan:
Non-Interactive Time-Stamping and Proofs of Work in the Random Oracle Model.
IACR Cryptology ePrint Archive 2011: 553 (2011) |
| 2010 |
| 20 |  | Tal Moran,
Tyler Moore:
The Phish-Market Protocol: Securely Sharing Attack Data between Competitors.
Financial Cryptography 2010: 222-237 |
| 19 |  | S. Dov Gordon,
Yuval Ishai,
Tal Moran,
Rafail Ostrovsky,
Amit Sahai:
On Complete Primitives for Fairness.
TCC 2010: 91-108 |
| 18 |  | John Kelsey,
Andrew Regenscheid,
Tal Moran,
David Chaum:
Attacking Paper-Based E2E Voting Systems.
Towards Trustworthy Elections 2010: 370-387 |
| 17 |  | Tal Moran,
Moni Naor:
Split-ballot voting: Everlasting privacy with distributed trust.
ACM Trans. Inf. Syst. Secur. 13(2): (2010) |
| 16 |  | Tal Moran,
Tyler Moore:
The Phish-Market Protocol: Secure Sharing Between Competitors.
IEEE Security & Privacy 8(4): 40-45 (2010) |
| 15 |  | Tal Moran,
Moni Naor:
Basing cryptographic protocols on tamper-evident seals.
Theor. Comput. Sci. 411(10): 1283-1310 (2010) |
| 2009 |
| 14 |  | Tal Moran,
Moni Naor,
Gil Segev:
An Optimally Fair Coin Toss.
TCC 2009: 1-18 |
| 13 |  | Tal Moran,
Moni Naor,
Gil Segev:
An Optimally Fair Coin Toss.
IACR Cryptology ePrint Archive 2009: 214 (2009) |
| 12 |  | Josh Benaloh,
Tal Moran,
Lee Naish,
Kim Ramchen,
Vanessa Teague:
Shuffle-sum: coercion-resistant verifiable tallying for STV voting.
IEEE Transactions on Information Forensics and Security 4(4): 685-698 (2009) |
| 11 |  | Tal Moran,
Ronen Shaltiel,
Amnon Ta-Shma:
Non-interactive Timestamping in the Bounded-Storage Model.
J. Cryptology 22(2): 189-226 (2009) |
| 10 |  | Tal Moran,
Moni Naor,
Gil Segev:
Deterministic History-Independent Strategies for Storing Information on Write-Once Memories.
Theory of Computing 5(1): 43-67 (2009) |
| 2008 |
| 9 |  | Tal Moran,
Gil Segev:
David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware.
EUROCRYPT 2008: 527-544 |
| 8 |  | Tal Moran,
Gil Segev:
David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware.
IACR Cryptology ePrint Archive 2008: 46 (2008) |
| 2007 |
| 7 |  | Tal Moran,
Moni Naor:
Split-ballot voting: everlasting privacy with distributed trust.
ACM Conference on Computer and Communications Security 2007: 246-255 |
| 6 |  | Tal Moran,
Moni Naor,
Gil Segev:
Deterministic History-Independent Strategies for Storing Information on Write-Once Memories.
ICALP 2007: 303-315 |
| 5 |  | Tal Moran,
Moni Naor,
Gil Segev:
Deterministic History-Independent Strategies for Storing Information on Write-Once Memories.
IACR Cryptology ePrint Archive 2007: 151 (2007) |
| 2006 |
| 4 |  | Tal Moran,
Moni Naor:
Receipt-Free Universally-Verifiable Voting with Everlasting Privacy.
CRYPTO 2006: 373-392 |
| 3 |  | Tal Moran,
Moni Naor:
Polling with Physical Envelopes: A Rigorous Analysis of a Human-Centric Protocol.
EUROCRYPT 2006: 88-108 |
| 2005 |
| 2 |  | Tal Moran,
Moni Naor:
Basing Cryptographic Protocols on Tamper-Evident Seals.
ICALP 2005: 285-297 |
| 2004 |
| 1 |  | Tal Moran,
Ronen Shaltiel,
Amnon Ta-Shma:
Non-interactive Timestamping in the Bounded Storage Model.
CRYPTO 2004: 460-476 |