Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2501.12080 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915868778168320 |
|---|---|
| author | Ruangwises, Suthee |
| author_facet | Ruangwises, Suthee |
| contents | Secure multi-party computation is an area in cryptography which studies how multiple parties can compare their private information without revealing it. Besides digital protocols, many unconventional protocols for secure multi-party computation using physical objects have also been developed. The vast majority of them use playing cards as the main tools. In 2024, Kaneko et al. introduced the use of a balance scale and coins in zero-knowledge proof protocols for pencil puzzles. In this paper, we extend the use of these tools to secure multi-party computation. In particular, we develop four protocols that can securely compute any $n$-variable Boolean function using a balance scale and coins. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_12080 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Balance-Based Cryptography: Physically Computing Any Boolean Function Ruangwises, Suthee Cryptography and Security Secure multi-party computation is an area in cryptography which studies how multiple parties can compare their private information without revealing it. Besides digital protocols, many unconventional protocols for secure multi-party computation using physical objects have also been developed. The vast majority of them use playing cards as the main tools. In 2024, Kaneko et al. introduced the use of a balance scale and coins in zero-knowledge proof protocols for pencil puzzles. In this paper, we extend the use of these tools to secure multi-party computation. In particular, we develop four protocols that can securely compute any $n$-variable Boolean function using a balance scale and coins. |
| title | Balance-Based Cryptography: Physically Computing Any Boolean Function |
| topic | Cryptography and Security |
| url | https://arxiv.org/abs/2501.12080 |