The following pages link to Marshall Ball (Q1653089):
Displaying 23 items.
- Exploring the boundaries of topology-hiding computation (Q1653090) (← links)
- Non-malleable codes from average-case hardness: \({\mathsf{A}}{\mathsf{C}}^0\), decision trees, and streaming space-bounded tampering (Q1653115) (← links)
- Proofs of Work from worst-case assumptions (Q1673424) (← links)
- Non-malleability against polynomial tampering (Q2102059) (← links)
- New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust (Q2104237) (← links)
- Topology-hiding communication from minimal assumptions (Q2119056) (← links)
- Is information-theoretic topology-hiding computation possible? (Q2175925) (← links)
- Non-malleable codes for decision trees (Q2181859) (← links)
- Non-malleable codes against bounded polynomial time tampering (Q2292657) (← links)
- Average-case fine-grained hardness (Q4977996) (← links)
- Non-malleable Codes for Bounded Depth, Bounded Fan-In Circuits (Q5739226) (← links)
- (Q5875787) (← links)
- Cryptography from Information Loss. (Q5875788) (← links)
- (Q5875794) (← links)
- Correction to: ``Topology-hiding communication from minimal assumptions'' (Q6054730) (← links)
- Linear Threshold Secret-Sharing with Binary Reconstruction (Q6107263) (← links)
- Communication complexity with defective randomness (Q6115368) (← links)
- (Q6126235) (← links)
- A note on the complexity of private simultaneous messages with many parties (Q6561687) (← links)
- Towards topology-hiding computation from oblivious transfer (Q6581794) (← links)
- Immunizing backdoored PRGs (Q6582215) (← links)
- Non-malleable codes with optimal rate for poly-size circuits (Q6637518) (← links)
- Towards permissionless consensus in the standard model via fine-grained complexity (Q6648203) (← links)
