Secure multiparty computations without computers

DOI10.1016/S0304-3975(97)00107-2zbMath0895.68097MaRDI QIDQ1127323

Valtteri Niemi, Ari Renvall

Publication date: 13 August 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

secure multiparty computations

Mathematics Subject Classification ID

Theory of computing (68Q99)

Related Items (12)

How to construct physical zero-knowledge proofs for puzzles with a ``single loop condition ⋮ Six-Card Secure AND and Four-Card Secure XOR ⋮ Efficient Card-Based Protocols for Generating a Hidden Random Permutation Without Fixed Points ⋮ Committed-format AND protocol using only random cuts ⋮ Actively revealing card attack on card-based protocols ⋮ Unnamed Item ⋮ Card-based zero-knowledge proof protocols for graph problems and their computational model ⋮ Securely computing the \(n\)-variable equality function with \(2n\) cards ⋮ Computations with a deck of cards ⋮ Card-based protocols for securely computing the conjunction of multiple variables ⋮ Card-based protocols using unequal division shuffles ⋮ Card-based cryptographic protocols for three-input functions using private operations

Cites Work

• Receipt-free secret-ballot elections (extended abstract)
• More Efficient Match-Making and Satisfiability The Five Card Trick
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Secure multiparty computations without computers