default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTal Moran
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i23]Eden Aldema Tshuva, Elette Boyle, Ran Cohen, Tal Moran, Rotem Oshman:
Locally Verifiable Distributed SNARGs. IACR Cryptol. ePrint Arch. 2024: 1385 (2024)- 2023
- [j12]Marshall Ball
, Elette Boyle, Ran Cohen, Lisa Kohl, Tal Malkin, Pierre Meyer, Tal Moran:
Topology-Hiding Communication from Minimal Assumptions. J. Cryptol. 36(4): 39 (2023) - [c33]Eden Aldema Tshuva, Elette Boyle, Ran Cohen, Tal Moran, Rotem Oshman:
Locally Verifiable Distributed SNARGs. TCC (1) 2023: 65-90 - [i22]Ran Cohen, Julian Loss, Tal Moran:
Efficient Agreement Over Byzantine Gossip. IACR Cryptol. ePrint Arch. 2023: 1507 (2023) - 2022
- [j11]Ilan Komargodski, Tal Moran, Moni Naor, Rafael Pass, Alon Rosen, Eylon Yogev:
One-Way Functions and (Im)perfect Obfuscation. SIAM J. Comput. 51(6): 1769-1795 (2022) - 2021
- [c32]Iddo Bentov, Pavel Hubácek, Tal Moran, Asaf Nadler:
Tortoise and Hares Consensus: The Meshcash Framework for Incentive-Compatible, Scalable Cryptocurrencies. CSCML 2021: 114-127 - [i21]Marshall Ball, Elette Boyle, Ran Cohen, Lisa Kohl, Tal Malkin, Pierre Meyer, Tal Moran:
Topology-Hiding Communication from Minimal Assumptions. IACR Cryptol. ePrint Arch. 2021: 388 (2021) - 2020
- [j10]Adi Akavia, Rio LaVigne, Tal Moran:
Topology-Hiding Computation on All Graphs. J. Cryptol. 33(1): 176-227 (2020) - [c31]Chen-Da Liu-Zhang, Julian Loss, Ueli Maurer, Tal Moran, Daniel Tschudi:
MPC with Synchronous Security and Asynchronous Responsiveness. ASIACRYPT (3) 2020: 92-119 - [c30]Oren Zuckerman, Dina Walker, Andrey Grishko, Tal Moran, Chen Levy, Barak Lisak, Iddo Yehoshua Wald, Hadas Erel:
Companionship Is Not a Function: The Effect of a Novel Robotic Object on Healthy Older Adults' Feelings of "Being-Seen". CHI 2020: 1-14 - [c29]Tal Moran, Daniel Wichs:
Incompressible Encodings. CRYPTO (1) 2020: 494-523 - [c28]Rio LaVigne, Chen-Da Liu Zhang, Ueli Maurer, Tal Moran, Marta Mularczyk, Daniel Tschudi:
Topology-Hiding Computation for Networks with Unknown Delays. Public Key Cryptography (2) 2020: 215-245 - [c27]Marshall Ball, Elette Boyle, Ran Cohen, Lisa Kohl, Tal Malkin, Pierre Meyer, Tal Moran:
Topology-Hiding Communication from Minimal Assumptions. TCC (2) 2020: 473-501 - [i20]Tal Moran, Daniel Wichs:
Incompressible Encodings. IACR Cryptol. ePrint Arch. 2020: 814 (2020)
2010 – 2019
- 2019
- [c26]Tal Moran, Ilan Orlov:
Simple Proofs of Space-Time and Rational Proofs of Storage. CRYPTO (1) 2019: 381-409 - [c25]Marshall Ball, Elette Boyle, Ran Cohen, Tal Malkin, Tal Moran:
Is Information-Theoretic Topology-Hiding Computation Possible? TCC (1) 2019: 502-530 - [i19]Chen-Da Liu Zhang, Julian Loss, Ueli Maurer, Tal Moran, Daniel Tschudi:
Robust MPC: Asynchronous Responsiveness yet Synchronous Security. IACR Cryptol. ePrint Arch. 2019: 159 (2019) - [i18]Marshall Ball, Elette Boyle, Ran Cohen, Tal Malkin, Tal Moran:
Is Information-Theoretic Topology-Hiding Computation Possible? IACR Cryptol. ePrint Arch. 2019: 1094 (2019) - [i17]Rio LaVigne, Chen-Da Liu Zhang, Ueli Maurer, Tal Moran, Marta Mularczyk, Daniel Tschudi:
Topology-Hiding Computation for Networks with Unknown Delays. IACR Cryptol. ePrint Arch. 2019: 1211 (2019) - 2018
- [c24]Marshall Ball, Elette Boyle, Tal Malkin, Tal Moran:
Exploring the Boundaries of Topology-Hiding Computation. EUROCRYPT (3) 2018: 294-325 - [c23]Rio LaVigne, Chen-Da Liu Zhang, Ueli Maurer, Tal Moran, Marta Mularczyk, Daniel Tschudi:
Topology-Hiding Computation Beyond Semi-Honest Adversaries. TCC (2) 2018: 3-35 - [i16]Julian Loss, Tal Moran:
Combining Asynchronous and Synchronous Byzantine Agreement: The Best of Both Worlds. IACR Cryptol. ePrint Arch. 2018: 235 (2018) - [i15]Rio LaVigne, Chen-Da Liu Zhang, Ueli Maurer, Tal Moran, Marta Mularczyk, Daniel Tschudi:
Topology-Hiding Computation Beyond Semi-Honest Adversaries. IACR Cryptol. ePrint Arch. 2018: 255 (2018) - 2017
- [c22]Adi Akavia, Rio LaVigne, Tal Moran:
Topology-Hiding Computation on All Graphs. CRYPTO (1) 2017: 447-467 - [c21]Adi Akavia, Tal Moran:
Topology-Hiding Computation Beyond Logarithmic Diameter. EUROCRYPT (3) 2017: 609-637 - [i14]Adi Akavia, Tal Moran:
Topology-Hiding Computation Beyond Logarithmic Diameter. IACR Cryptol. ePrint Arch. 2017: 130 (2017) - [i13]Adi Akavia, Rio LaVigne, Tal Moran:
Topology-Hiding Computation on all Graphs. IACR Cryptol. ePrint Arch. 2017: 296 (2017) - [i12]Iddo Bentov, Pavel Hubácek, Tal Moran, Asaf Nadler:
Tortoise and Hares Consensus: the Meshcash Framework for Incentive-Compatible, Scalable Cryptocurrencies. IACR Cryptol. ePrint Arch. 2017: 300 (2017) - 2016
- [j9]Tal Moran, Moni Naor, Gil Segev:
An Optimally Fair Coin Toss. J. Cryptol. 29(3): 491-513 (2016) - [j8]Yiling Chen, Stephen Chong, Ian A. Kash, Tal Moran, Salil P. Vadhan:
Truthful Mechanisms for Agents That Value Privacy. ACM Trans. Economics and Comput. 4(3): 13:1-13:30 (2016) - [i11]Tal Moran, Ilan Orlov:
Proofs of Space-Time and Rational Proofs of Storage. IACR Cryptol. ePrint Arch. 2016: 35 (2016) - 2015
- [c20]Ranjit Kumaresan, Tal Moran, Iddo Bentov:
How to Use Bitcoin to Play Decentralized Poker. CCS 2015: 195-206 - [c19]Tal Moran, Ilan Orlov, Silas Richelson:
Topology-Hiding Computation. TCC (1) 2015: 159-181 - [c18]Giulia Alberini, Tal Moran, Alon Rosen:
Public Verification of Private Effort. TCC (2) 2015: 169-198 - 2014
- [c17]Ilan Komargodski, Tal Moran, Moni Naor, Rafael Pass, Alon Rosen, Eylon Yogev:
One-Way Functions and (Im)Perfect Obfuscation. FOCS 2014: 374-383 - [i10]Ilan Komargodski, Tal Moran, Moni Naor, Rafael Pass, Alon Rosen, Eylon Yogev:
One-Way Functions and (Im)perfect Obfuscation. IACR Cryptol. ePrint Arch. 2014: 347 (2014) - [i9]Giulia Alberini, Tal Moran, Alon Rosen:
Public Verification of Private Effort. IACR Cryptol. ePrint Arch. 2014: 983 (2014) - [i8]Tal Moran, Ilan Orlov, Silas Richelson:
Topology-Hiding Computation. IACR Cryptol. ePrint Arch. 2014: 1022 (2014) - 2013
- [j7]Tal Moran:
Review of Surveillance or Security? by Susan Landau. SIGACT News 44(1): 14-16 (2013) - [c16]Mohammad Mahmoody, Tal Moran, Salil P. Vadhan:
Publicly verifiable proofs of sequential work. ITCS 2013: 373-388 - [c15]Yiling Chen, Stephen Chong, Ian A. Kash, Tal Moran, Salil P. Vadhan:
Truthful mechanisms for agents that value privacy. EC 2013: 215-232 - [i7]Tal Moran, Alon Rosen:
There is no Indistinguishability Obfuscation in Pessiland. IACR Cryptol. ePrint Arch. 2013: 643 (2013) - 2012
- [c14]Shahram Khazaei, Tal Moran, Douglas Wikström:
A Mix-Net from Any CCA2 Secure Cryptosystem. ASIACRYPT 2012: 607-625 - [c13]Yevgeniy Dodis, Abhishek Jain, Tal Moran, Daniel Wichs:
Counterexamples to Hardness Amplification beyond Negligible. TCC 2012: 476-493 - [i6]Yevgeniy Dodis, Abhishek Jain, Tal Moran, Daniel Wichs:
Counterexamples to Hardness Amplification Beyond Negligible. IACR Cryptol. ePrint Arch. 2012: 32 (2012) - 2011
- [c12]Mohammad Mahmoody, Tal Moran, Salil P. Vadhan:
Time-Lock Puzzles in the Random Oracle Model. CRYPTO 2011: 39-50 - [i5]Yiling Chen, Stephen Chong, Ian A. Kash, Tal Moran, Salil P. Vadhan:
Truthful Mechanisms for Agents that Value Privacy. CoRR abs/1111.5472 (2011) - [i4]Mohammad Mahmoody, Tal Moran, Salil P. Vadhan:
Non-Interactive Time-Stamping and Proofs of Work in the Random Oracle Model. IACR Cryptol. ePrint Arch. 2011: 553 (2011) - 2010
- [j6]Tal Moran, Tyler Moore:
The Phish-Market Protocol: Secure Sharing Between Competitors. IEEE Secur. Priv. 8(4): 40-45 (2010) - [j5]Tal Moran, Moni Naor:
Basing cryptographic protocols on tamper-evident seals. Theor. Comput. Sci. 411(10): 1283-1310 (2010) - [j4]Tal Moran, Moni Naor:
Split-ballot voting: Everlasting privacy with distributed trust. ACM Trans. Inf. Syst. Secur. 13(2): 16:1-16:43 (2010) - [c11]Tal Moran, Tyler Moore:
The Phish-Market Protocol: Securely Sharing Attack Data between Competitors. Financial Cryptography 2010: 222-237 - [c10]S. Dov Gordon, Yuval Ishai, Tal Moran, Rafail Ostrovsky, Amit Sahai:
On Complete Primitives for Fairness. TCC 2010: 91-108 - [c9]John Kelsey, Andrew Regenscheid, Tal Moran, David Chaum:
Attacking Paper-Based E2E Voting Systems. Towards Trustworthy Elections 2010: 370-387
2000 – 2009
- 2009
- [j3]Tal Moran, Ronen Shaltiel, Amnon Ta-Shma:
Non-interactive Timestamping in the Bounded-Storage Model. J. Cryptol. 22(2): 189-226 (2009) - [j2]Josh Benaloh, Tal Moran, Lee Naish, Kim Ramchen, Vanessa Teague:
Shuffle-sum: coercion-resistant verifiable tallying for STV voting. IEEE Trans. Inf. Forensics Secur. 4(4): 685-698 (2009) - [j1]Tal Moran, Moni Naor, Gil Segev:
Deterministic History-Independent Strategies for Storing Information on Write-Once Memories. Theory Comput. 5(1): 43-67 (2009) - [c8]Tal Moran, Moni Naor, Gil Segev:
An Optimally Fair Coin Toss. TCC 2009: 1-18 - [e1]David Jefferson, Joseph Lorenzo Hall, Tal Moran:
2009 Electronic Voting Technology Workshop / Workshop on Trustworthy Elections, EVT/WOTE '09, Montreal, Canada, August 10-11, 2009. USENIX Association 2009 [contents] - [i3]Tal Moran, Moni Naor, Gil Segev:
An Optimally Fair Coin Toss. IACR Cryptol. ePrint Arch. 2009: 214 (2009) - 2008
- [c7]Tal Moran, Gil Segev:
David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware. EUROCRYPT 2008: 527-544 - [i2]Tal Moran, Gil Segev:
David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware. IACR Cryptol. ePrint Arch. 2008: 46 (2008) - 2007
- [c6]Tal Moran, Moni Naor:
Split-ballot voting: everlasting privacy with distributed trust. CCS 2007: 246-255 - [c5]Tal Moran, Moni Naor, Gil Segev:
Deterministic History-Independent Strategies for Storing Information on Write-Once Memories. ICALP 2007: 303-315 - [i1]Tal Moran, Moni Naor, Gil Segev:
Deterministic History-Independent Strategies for Storing Information on Write-Once Memories. IACR Cryptol. ePrint Arch. 2007: 151 (2007) - 2006
- [c4]Tal Moran, Moni Naor:
Receipt-Free Universally-Verifiable Voting with Everlasting Privacy. CRYPTO 2006: 373-392 - [c3]Tal Moran, Moni Naor:
Polling with Physical Envelopes: A Rigorous Analysis of a Human-Centric Protocol. EUROCRYPT 2006: 88-108 - 2005
- [c2]Tal Moran, Moni Naor:
Basing Cryptographic Protocols on Tamper-Evident Seals. ICALP 2005: 285-297 - 2004
- [c1]Tal Moran, Ronen Shaltiel, Amnon Ta-Shma:
Non-interactive Timestamping in the Bounded Storage Model. CRYPTO 2004: 460-476
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 2025-01-21 00:22 CET 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:
