Receipt-Free Universally-Verifiable Voting with Everlasting Privacy. - Tal Moran; Moni Naor (CRYPTO, 2006)

Polling with Physical Envelopes: A Rigorous Analysis of a Human-Centric Protocol. - Tal Moran; Moni Naor (EUROCRYPT, 2006)

David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware. - Tal Moran; Gil Segev 001 (IACR Cryptol. ePrint Arch., 2008)

Non-interactive Timestamping in the Bounded-Storage Model. - Tal Moran; Ronen Shaltiel; Amnon Ta-Shma (J. Cryptol., 2009)

Shuffle-sum: coercion-resistant verifiable tallying for STV voting. - Josh Benaloh; Tal Moran; Lee Naish; Kim Ramchen; Vanessa Teague (IEEE Trans. Inf. Forensics Secur., 2009)

Deterministic History-Independent Strategies for Storing Information on Write-Once Memories. - Tal Moran; Moni Naor; Gil Segev 001 (Theory Comput., 2009)

The Phish-Market Protocol: Securely Sharing Attack Data between Competitors. - Tal Moran; Tyler Moore 001 (Financial Cryptography, 2010)

On Complete Primitives for Fairness. - S. Dov Gordon; Yuval Ishai; Tal Moran; Rafail Ostrovsky; Amit Sahai (TCC, 2010)

Attacking Paper-Based E2E Voting Systems. - John Kelsey; Andrew Regenscheid; Tal Moran; David Chaum (Towards Trustworthy Elections, 2010)

The Phish-Market Protocol: Secure Sharing Between Competitors. - Tal Moran; Tyler Moore 001 (IEEE Secur. Priv., 2010)

Basing cryptographic protocols on tamper-evident seals. - Tal Moran; Moni Naor (Theor. Comput. Sci., 2010)

Split-ballot voting: Everlasting privacy with distributed trust. - Tal Moran; Moni Naor (ACM Trans. Inf. Syst. Secur., 2010)

Time-Lock Puzzles in the Random Oracle Model. - Mohammad Mahmoody; Tal Moran; Salil P. Vadhan (CRYPTO, 2011)

Non-Interactive Time-Stamping and Proofs of Work in the Random Oracle Model. - Mohammad Mahmoody; Tal Moran; Salil P. Vadhan (IACR Cryptol. ePrint Arch., 2011)

A Mix-Net from Any CCA2 Secure Cryptosystem. - Shahram Khazaei; Tal Moran; Douglas Wikström (ASIACRYPT, 2012)

Counterexamples to Hardness Amplification Beyond Negligible. - Yevgeniy Dodis; Abhishek Jain 002; Tal Moran; Daniel Wichs (IACR Cryptol. ePrint Arch., 2012)

Publicly verifiable proofs of sequential work. - Mohammad Mahmoody; Tal Moran; Salil P. Vadhan (ITCS, 2013)

There is no Indistinguishability Obfuscation in Pessiland. - Tal Moran; Alon Rosen (IACR Cryptol. ePrint Arch., 2013)

Review of Surveillance or Security? by Susan Landau. - Tal Moran (SIGACT News, 2013)

Public Verification of Private Effort. - Giulia Alberini; Tal Moran; Alon Rosen (IACR Cryptol. ePrint Arch., 2014)

Topology-Hiding Computation. - Tal Moran; Ilan Orlov; Silas Richelson (IACR Cryptol. ePrint Arch., 2014)

How to Use Bitcoin to Play Decentralized Poker. - Ranjit Kumaresan; Tal Moran; Iddo Bentov (CCS, 2015)

Proofs of Space-Time and Rational Proofs of Storage. - Tal Moran; Ilan Orlov (IACR Cryptol. ePrint Arch., 2016)

An Optimally Fair Coin Toss. - Tal Moran; Moni Naor; Gil Segev 001 (J. Cryptol., 2016)

Truthful Mechanisms for Agents That Value Privacy. - Yiling Chen 001; Stephen Chong; Ian A. Kash; Tal Moran; Salil P. Vadhan (ACM Trans. Economics and Comput., 2016)

Topology-Hiding Computation Beyond Logarithmic Diameter. - Adi Akavia; Tal Moran (IACR Cryptol. ePrint Arch., 2017)

Tortoise and Hares Consensus: the Meshcash Framework for Incentive-Compatible, Scalable Cryptocurrencies. - Iddo Bentov; Pavel Hubácek; Tal Moran; Asaf Nadler (IACR Cryptol. ePrint Arch., 2017)

Exploring the Boundaries of Topology-Hiding Computation. - Marshall Ball; Elette Boyle; Tal Malkin; Tal Moran (EUROCRYPT (3), 2018)

Topology-Hiding Computation Beyond Semi-Honest Adversaries. - Rio LaVigne; Chen-Da Liu Zhang; Ueli Maurer; Tal Moran; Marta Mularczyk; Daniel Tschudi (IACR Cryptol. ePrint Arch., 2018)

Combining Asynchronous and Synchronous Byzantine Agreement: The Best of Both Worlds. - Julian Loss; Tal Moran (IACR Cryptol. ePrint Arch., 2018)

Simple Proofs of Space-Time and Rational Proofs of Storage. - Tal Moran; Ilan Orlov (CRYPTO (1), 2019)

Is Information-Theoretic Topology-Hiding Computation Possible? - Marshall Ball; Elette Boyle; Ran Cohen; Tal Malkin; Tal Moran (IACR Cryptol. ePrint Arch., 2019)

Topology-Hiding Computation for Networks with Unknown Delays. - Rio LaVigne; Chen-Da Liu Zhang; Ueli Maurer; Tal Moran; Marta Mularczyk; Daniel Tschudi (IACR Cryptol. ePrint Arch., 2019)

Robust MPC: Asynchronous Responsiveness yet Synchronous Security. - Chen-Da Liu Zhang; Julian Loss; Ueli Maurer; Tal Moran; Daniel Tschudi (IACR Cryptol. ePrint Arch., 2019)

MPC with Synchronous Security and Asynchronous Responsiveness. - Chen-Da Liu-Zhang; Julian Loss; Ueli Maurer; Tal Moran; Daniel Tschudi (ASIACRYPT (3), 2020)

Companionship Is Not a Function: The Effect of a Novel Robotic Object on Healthy Older Adults' Feelings of "Being-Seen". - Oren Zuckerman; Dina Walker; Andrey Grishko; Tal Moran; Chen Levy; Barak Lisak; Iddo Yehoshua Wald; Hadas Erel (CHI, 2020)

Incompressible Encodings. - Tal Moran; Daniel Wichs (IACR Cryptol. ePrint Arch., 2020)

Topology-Hiding Computation on All Graphs. - Adi Akavia; Rio LaVigne; Tal Moran (J. Cryptol., 2020)

One-Way Functions and (Im)perfect Obfuscation. - Ilan Komargodski; Tal Moran; Moni Naor; Rafael Pass; Alon Rosen; Eylon Yogev (SIAM J. Comput., 2022)

Efficient Agreement Over Byzantine Gossip. - Ran Cohen; Julian Loss; Tal Moran (IACR Cryptol. ePrint Arch., 2023)

Topology-Hiding Communication from Minimal Assumptions. - Marshall Ball; Elette Boyle; Ran Cohen; Lisa Kohl; Tal Malkin; Pierre Meyer; Tal Moran (J. Cryptol., 2023)

Locally Verifiable Distributed SNARGs. - Eden Aldema Tshuva; Elette Boyle; Ran Cohen; Tal Moran; Rotem Oshman (IACR Cryptol. ePrint Arch., 2024)