The following pages link to (Q3826475):
Displaying 20 items.
- Communication-efficient distributed oblivious transfer (Q439979) (← links)
- Constant-round perfect zero-knowledge computationally convincing protocols (Q808240) (← links)
- Bit commitment using pseudorandomness (Q808241) (← links)
- Secure circuit evaluation. A protocol based on hiding information from an oracle (Q913487) (← links)
- A discrete logarithm implementation of perfect zero-knowledge blobs (Q913490) (← links)
- Minimum disclosure proofs of knowledge (Q1110348) (← links)
- Secure multiparty computations without computers (Q1127323) (← links)
- On the communication complexity of zero-knowledge proofs (Q1261016) (← links)
- Guaranteed output delivery comes free in honest majority MPC (Q2096542) (← links)
- ATLAS: efficient and scalable MPC in the honest majority setting (Q2128563) (← links)
- Secure multi-party computation in large networks (Q2401120) (← links)
- On the exact round complexity of best-of-both-worlds multi-party computation (Q2691581) (← links)
- The Cost of Fault Tolerance in Multi-Party Communication Complexity (Q3189654) (← links)
- Protocols for collusion-secure asymmetric fingerprinting (Q5048941) (← links)
- How to fairly reconstruct a shared secret (Q5235415) (← links)
- On the exact round complexity of secure three-party computation (Q5918099) (← links)
- Computations with a deck of cards (Q5941300) (← links)
- Beyond honest majority: the round complexity of fair and robust multi-party computation (Q6109085) (← links)
- Threshold secret sharing with geometric algebras (Q6496087) (← links)
- Broadcast-optimal four-round MPC in the plain model (Q6582165) (← links)
