The following pages link to Mor Weiss (Q1631351):
Displaying 20 items.
- How to construct a leakage-resilient (stateless) trusted party (Q1690270) (← links)
- Multi-key searchable encryption, revisited (Q1749275) (← links)
- The price of active security in cryptographic protocols (Q2119012) (← links)
- ZK-PCPs from leakage-resilient secret sharing (Q2159466) (← links)
- Permuted puzzles and cryptographic hardness (Q2175950) (← links)
- On the plausibility of fully homomorphic encryption for RAMs (Q2181866) (← links)
- Private anonymous data access (Q2292872) (← links)
- Making the Best of a Leaky Situation: Zero-Knowledge PCPs from Leakage-Resilient Circuits (Q2799088) (← links)
- Zero Knowledge LTCs and Their Applications (Q2851889) (← links)
- Binary AMD Circuits from Secure Multiparty Computation (Q3179363) (← links)
- Probabilistically Checkable Proofs of Proximity with Zero-Knowledge (Q5746335) (← links)
- Is there an oblivious RAM lower bound for online reads? (Q5915623) (← links)
- Is there an oblivious RAM lower bound for online reads? (Q5918328) (← links)
- (Q6107255) (← links)
- Protecting distributed primitives against leakage: equivocal secret sharing and more (Q6561680) (← links)
- Beyond MPC-in-the-head: black-box constructions of short zero-knowledge proofs (Q6581781) (← links)
- Your reputation's safe with me: framing-free distributed zero-knowledge proofs (Q6581782) (← links)
- The price of active security in cryptographic protocols (Q6595846) (← links)
- Protecting distributed primitives against leakage: equivocal secret sharing and more (Q6639504) (← links)
- Zero-knowledge IOPs approaching witness length (Q6660294) (← links)
