The following pages link to Tal Moran (Q315539):
Displaying 32 items.
- An optimally fair coin toss (Q315542) (← links)
- Non-interactive timestamping in the bounded-storage model (Q1015360) (← links)
- Topology-hiding computation beyond semi-honest adversaries (Q1631311) (← links)
- Exploring the boundaries of topology-hiding computation (Q1653090) (← links)
- Topology-hiding computation for networks with unknown delays (Q2055692) (← links)
- Incompressible encodings (Q2096497) (← links)
- Topology-hiding communication from minimal assumptions (Q2119056) (← links)
- Is information-theoretic topology-hiding computation possible? (Q2175925) (← links)
- Simple proofs of space-time and rational proofs of storage (Q2181858) (← links)
- Basing cryptographic protocols on tamper-evident seals (Q2268101) (← links)
- MPC with synchronous security and asynchronous responsiveness (Q2691582) (← links)
- Counterexamples to Hardness Amplification beyond Negligible (Q2891501) (← links)
- Publicly verifiable proofs of sequential work (Q2986887) (← links)
- (Q3002800) (← links)
- On Complete Primitives for Fairness (Q3408189) (← links)
- Polling with Physical Envelopes: A Rigorous Analysis of a Human-Centric Protocol (Q3593091) (← links)
- An Optimally Fair Coin Toss (Q3611755) (← links)
- A Mix-Net from Any CCA2 Secure Cryptosystem (Q4911611) (← links)
- Time-Lock Puzzles in the Random Oracle Model (Q5199183) (← links)
- Topology-Hiding Computation (Q5261628) (← links)
- Public Verification of Private Effort (Q5261675) (← links)
- Topology-Hiding Computation Beyond Logarithmic Diameter (Q5270378) (← links)
- Advances in Cryptology – CRYPTO 2004 (Q5311550) (← links)
- Deterministic History-Independent Strategies for Storing Information on Write-Once Memories (Q5428818) (← links)
- David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware (Q5458612) (← links)
- Automata, Languages and Programming (Q5716782) (← links)
- Receipt-Free Universally-Verifiable Voting with Everlasting Privacy (Q5756632) (← links)
- One-Way Functions and (Im)perfect Obfuscation (Q5885583) (← links)
- Topology-hiding computation on all graphs (Q5915735) (← links)
- Topology-hiding computation on all graphs (Q5919491) (← links)
- Correction to: ``Topology-hiding communication from minimal assumptions'' (Q6054730) (← links)
- Locally verifiable distributed SNARGs (Q6581783) (← links)
