Tal Moran

Orcid: 0000-0002-1456-0899

According to our database1, Tal Moran authored at least 42 papers between 2006 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Locally Verifiable Distributed SNARGs.
IACR Cryptol. ePrint Arch., 2024

2023
Topology-Hiding Communication from Minimal Assumptions.
J. Cryptol., October, 2023

Efficient Agreement Over Byzantine Gossip.
IACR Cryptol. ePrint Arch., 2023

2022
One-Way Functions and (Im)perfect Obfuscation.
SIAM J. Comput., 2022

2020
Topology-Hiding Computation on All Graphs.
J. Cryptol., 2020

Incompressible Encodings.
IACR Cryptol. ePrint Arch., 2020

Companionship Is Not a Function: The Effect of a Novel Robotic Object on Healthy Older Adults' Feelings of "Being-Seen".
Proceedings of the CHI '20: CHI Conference on Human Factors in Computing Systems, 2020

MPC with Synchronous Security and Asynchronous Responsiveness.
Proceedings of the Advances in Cryptology - ASIACRYPT 2020, 2020

2019
Robust MPC: Asynchronous Responsiveness yet Synchronous Security.
IACR Cryptol. ePrint Arch., 2019

Topology-Hiding Computation for Networks with Unknown Delays.
IACR Cryptol. ePrint Arch., 2019

Is Information-Theoretic Topology-Hiding Computation Possible?
IACR Cryptol. ePrint Arch., 2019

Simple Proofs of Space-Time and Rational Proofs of Storage.
Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

2018
Combining Asynchronous and Synchronous Byzantine Agreement: The Best of Both Worlds.
IACR Cryptol. ePrint Arch., 2018

Topology-Hiding Computation Beyond Semi-Honest Adversaries.
IACR Cryptol. ePrint Arch., 2018

Exploring the Boundaries of Topology-Hiding Computation.
Proceedings of the Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29, 2018

2017
Tortoise and Hares Consensus: the Meshcash Framework for Incentive-Compatible, Scalable Cryptocurrencies.
IACR Cryptol. ePrint Arch., 2017

Topology-Hiding Computation Beyond Logarithmic Diameter.
IACR Cryptol. ePrint Arch., 2017

2016
Truthful Mechanisms for Agents That Value Privacy.
ACM Trans. Economics and Comput., 2016

An Optimally Fair Coin Toss.
J. Cryptol., 2016

Proofs of Space-Time and Rational Proofs of Storage.
IACR Cryptol. ePrint Arch., 2016

2015
How to Use Bitcoin to Play Decentralized Poker.
Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, 2015

2014
Topology-Hiding Computation.
IACR Cryptol. ePrint Arch., 2014

Public Verification of Private Effort.
IACR Cryptol. ePrint Arch., 2014

2013
Review of Surveillance or Security? by Susan Landau.
SIGACT News, 2013

There is no Indistinguishability Obfuscation in Pessiland.
IACR Cryptol. ePrint Arch., 2013

Publicly verifiable proofs of sequential work.
Proceedings of the Innovations in Theoretical Computer Science, 2013

2012
Counterexamples to Hardness Amplification Beyond Negligible.
IACR Cryptol. ePrint Arch., 2012

A Mix-Net from Any CCA2 Secure Cryptosystem.
Proceedings of the Advances in Cryptology - ASIACRYPT 2012, 2012

2011
Non-Interactive Time-Stamping and Proofs of Work in the Random Oracle Model.
IACR Cryptol. ePrint Arch., 2011

Time-Lock Puzzles in the Random Oracle Model.
Proceedings of the Advances in Cryptology - CRYPTO 2011, 2011

2010
Split-ballot voting: Everlasting privacy with distributed trust.
ACM Trans. Inf. Syst. Secur., 2010

Basing cryptographic protocols on tamper-evident seals.
Theor. Comput. Sci., 2010

The Phish-Market Protocol: Secure Sharing Between Competitors.
IEEE Secur. Priv., 2010

Attacking Paper-Based E2E Voting Systems.
Proceedings of the Towards Trustworthy Elections, New Directions in Electronic Voting, 2010

On Complete Primitives for Fairness.
Proceedings of the Theory of Cryptography, 7th Theory of Cryptography Conference, 2010

The Phish-Market Protocol: Securely Sharing Attack Data between Competitors.
Proceedings of the Financial Cryptography and Data Security, 14th International Conference, 2010

2009
Deterministic History-Independent Strategies for Storing Information on Write-Once Memories.
Theory Comput., 2009

Shuffle-sum: coercion-resistant verifiable tallying for STV voting.
IEEE Trans. Inf. Forensics Secur., 2009

Non-interactive Timestamping in the Bounded-Storage Model.
J. Cryptol., 2009

2008
David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware.
IACR Cryptol. ePrint Arch., 2008

2006
Polling with Physical Envelopes: A Rigorous Analysis of a Human-Centric Protocol.
Proceedings of the Advances in Cryptology - EUROCRYPT 2006, 25th Annual International Conference on the Theory and Applications of Cryptographic Techniques, St. Petersburg, Russia, May 28, 2006

Receipt-Free Universally-Verifiable Voting with Everlasting Privacy.
Proceedings of the Advances in Cryptology, 2006


  Loading...