Pages that link to "Item:Q1127323"
From MaRDI portal
The following pages link to Secure multiparty computations without computers (Q1127323):
Displaying 21 items.
- Secure computation without computers (Q517015) (← links)
- How to construct physical zero-knowledge proofs for puzzles with a ``single loop'' condition (Q820565) (← links)
- Characterization of secure multiparty computation without broadcast (Q1753172) (← links)
- Card-based protocols using unequal division shuffles (Q1797742) (← links)
- Efficient and secure multiparty computations using a standard deck of playing cards (Q1989459) (← links)
- Card-based cryptographic protocols for three-input functions using private operations (Q2115886) (← links)
- Card-based zero-knowledge proof protocols for graph problems and their computational model (Q2697917) (← links)
- Efficient Card-Based Protocols for Generating a Hidden Random Permutation Without Fixed Points (Q2945569) (← links)
- Who holds the best card? Secure communication of optimal secret bits (Q5000284) (← links)
- Six-Card Secure AND and Four-Card Secure XOR (Q5321728) (← links)
- Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol (Q5756545) (← links)
- Securely computing the \(n\)-variable equality function with \(2n\) cards (Q5896830) (← links)
- Computations with a deck of cards (Q5941300) (← links)
- Card-based protocols for securely computing the conjunction of multiple variables (Q5964073) (← links)
- Multi-party computation based on physical coins (Q6049058) (← links)
- Committed-format AND protocol using only random cuts (Q6095508) (← links)
- Actively revealing card attack on card-based protocols (Q6136456) (← links)
- Card-Based Secure Sorting Protocol (Q6487420) (← links)
- Public-PEZ Cryptography (Q6488002) (← links)
- Card-based protocol against actively revealing card attack (Q6536365) (← links)
- Single-shuffle card-based protocols with six cards per gate (Q6547900) (← links)
