Pages that link to "Item:Q809588"
From MaRDI portal
The following pages link to Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority (Q809588):
Displaying 15 items.
- Multi-party computation with conversion of secret sharing (Q664384) (← links)
- Correlation and unmediated cheap talk in repeated games with imperfect monitoring (Q1684128) (← links)
- Quantum private comparison protocol with five-particle cluster states (Q1740868) (← links)
- Task-structured probabilistic I/O automata (Q1745718) (← links)
- Efficient asynchronous verifiable secret sharing and multiparty computation (Q2018817) (← links)
- MPC with friends and foes (Q2096545) (← links)
- Universally composable symbolic security analysis (Q2429708) (← links)
- The reactive simulatability (RSIM) framework for asynchronous systems (Q2464139) (← links)
- Unifying simulatability definitions in cryptographic systems under different timing assumptions (Q2484407) (← links)
- Secure multi-party computation made simple (Q2489932) (← links)
- Adaptive security of multi-party protocols, revisited (Q2695654) (← links)
- The Cost of Fault Tolerance in Multi-Party Communication Complexity (Q3189654) (← links)
- Protocols for collusion-secure asymmetric fingerprinting (Q5048941) (← links)
- Cryptography and cryptographic protocols (Q5138490) (← links)
- Resilient-optimal interactive consistency in constant time (Q5138494) (← links)