Balance-Based Cryptography: Physically Computing Any Boolean Function

• URL: http://arxiv.org/abs/2501.12080v1
• Date: Tue, 21 Jan 2025 12:11:00 GMT
• Title: Balance-Based Cryptography: Physically Computing Any Boolean Function
• Abstract summary: We introduce the use of a balance scale and coins as new physical tools for secure multi-party computation.<n>In particular, we develop four protocols that can securely compute any $n$-variable Boolean function using a balance scale and coins.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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 physical protocols for secure multi-party computation using portable objects found in everyday life have also been developed. The vast majority of them use cards as the main tools. In this paper, we introduce the use of a balance scale and coins as new physical tools for 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.

Related papers

• CryptDough: A Unified Analytics Engine for Secure Multiparty Computation [40.143278251997494]
  CryptDough is a unified analytics engine for secure multiparty computation (MPC)<n>It enables multiple distrusting parties to jointly execute a data analysis pipeline on their private inputs and learn nothing beyond the result.<n>We show that CryptDough generalizes the functionality of state-of-the-art MPC systems and remains competitive on the analytics they support.
  arXiv  Detail & Related papers  (2026-08-18T08:50:49Z)
• Information-Theoretic Decentralized Secure Aggregation with Collusion Resilience [98.31540557973179]
  We study the problem of decentralized secure aggregation (DSA) from an information-theoretic perspective.<n>We characterize the optimal rate region, which specifies the minimum achievable communication and secret key rates for DSA.<n>Our results establish the fundamental performance limits of DSA, providing insights for the design of provably secure and communication-efficient protocols.
  arXiv  Detail & Related papers  (2025-08-01T12:51:37Z)
• Post-Quantum Cryptography: An Analysis of Code-Based and Lattice-Based Cryptosystems [55.49917140500002]
  Quantum computers will be able to break modern cryptographic systems using Shor's Algorithm.<n>We first examine the McEliece cryptosystem, a code-based scheme believed to be secure against quantum attacks.<n>We then explore NTRU, a lattice-based system grounded in the difficulty of solving the Shortest Vector Problem.
  arXiv  Detail & Related papers  (2025-05-06T03:42:38Z)
• Practical Secure Aggregation by Combining Cryptography and Trusted Execution Environments [1.3068730884406587]
  Secure aggregation enables a group of mutually distrustful parties, each holding private inputs, to collaboratively compute an aggregate value. A major challenge in adopting secure aggregation approaches for practical applications is the significant computational overhead of the underlying cryptographic protocols. Hardware-based security techniques such as trusted execution environments (TEEs) enable computation at near-native speeds. In this work, we introduce several secure aggregation architectures that integrate both cryptographic and TEE-based techniques.
  arXiv  Detail & Related papers  (2025-04-11T07:49:09Z)
• Cryptanalysis via Machine Learning Based Information Theoretic Metrics [58.96805474751668]
  We propose two novel applications of machine learning (ML) algorithms to perform cryptanalysis on any cryptosystem. These algorithms can be readily applied in an audit setting to evaluate the robustness of a cryptosystem. We show that our classification model correctly identifies the encryption schemes that are not IND-CPA secure, such as DES, RSA, and AES ECB, with high accuracy.
  arXiv  Detail & Related papers  (2025-01-25T04:53:36Z)
• Experimental Secure Multiparty Computation from Quantum Oblivious Transfer with Bit Commitment [13.244842672008811]
  Secure multiparty computation can be realized using oblivious transfer as a primitive function. We present an experimental implementation of a quantum-secure quantum oblivious transfer protocol. In our experiments, two banks can identify common suspicious accounts without disclosing any other data.
  arXiv  Detail & Related papers  (2024-11-07T09:29:12Z)
• Quantum digital signature based on single-qubit without a trusted third-party [45.41082277680607]
  We propose a brand new quantum digital signature protocol without a trusted third party only with qubit technology to further improve the security. We prove that the protocol has information-theoretical unforgeability. Moreover, it satisfies other important secure properties, including asymmetry, undeniability, and expandability.
  arXiv  Detail & Related papers  (2024-10-17T09:49:29Z)
• Revocable Encryption, Programs, and More: The Case of Multi-Copy Security [48.53070281993869]
  We show the feasibility of revocable primitives, such as revocable encryption and revocable programs. This suggests that the stronger notion of multi-copy security is within reach in unclonable cryptography.
  arXiv  Detail & Related papers  (2024-10-17T02:37:40Z)
• Single-Round Proofs of Quantumness from Knowledge Assumptions [41.94295877935867]
  A proof of quantumness is an efficiently verifiable interactive test that an efficient quantum computer can pass. Existing single-round protocols require large quantum circuits, whereas multi-round ones use smaller circuits but require experimentally challenging mid-circuit measurements. We construct efficient single-round proofs of quantumness based on existing knowledge assumptions.
  arXiv  Detail & Related papers  (2024-05-24T17:33:10Z)
• Quantum Secure Protocols for Multiparty Computations [2.9561405287476177]
  We present secure multiparty computation (MPC) protocols that can withstand quantum attacks. We first present the design and analysis of an information-theoretic secure oblivious linear evaluation (OLE), namely $sf qOLE$ in the quantum domain. We further utilize $sf qOLE$ as a building block to construct a quantum-safe multiparty private set intersection (MPSI) protocol.
  arXiv  Detail & Related papers  (2023-12-26T19:53:29Z)
• Demonstration of quantum-digital payments [36.136619420474766]
  We show how quantum light can secure daily digital payments by generating inherently unforgeable quantum cryptograms. Unlike previously proposed protocols, our solution does not depend on long-term quantum storage or trusted agents and authenticated channels. It is practical with near-term technology and may herald an era of quantum-enabled security.
  arXiv  Detail & Related papers  (2023-05-23T20:20:14Z)
• THE-X: Privacy-Preserving Transformer Inference with Homomorphic Encryption [112.02441503951297]
  Privacy-preserving inference of transformer models is on the demand of cloud service users. We introduce $textitTHE-X$, an approximation approach for transformers, which enables privacy-preserving inference of pre-trained models.
  arXiv  Detail & Related papers  (2022-06-01T03:49:18Z)
• Experimental realization of BB84 protocol with different phase gates and SARG04 protocol [0.0]
  High computing power can help you crack traditional encryption methods. Factorization of big numbers may be possible with Shor's algorithm with quantum machines in considerable time. This paper begins with experimental verification of the BB84 procedure utilizing four bases.
  arXiv  Detail & Related papers  (2021-09-25T14:31:18Z)
• Ranking the information content of distance measures [61.754016309475745]
  We introduce a statistical test that can assess the relative information retained when using two different distance measures. This in turn allows finding the most informative distance measure out of a pool of candidates.
  arXiv  Detail & Related papers  (2021-04-30T15:57:57Z)
• Quantum copy-protection of compute-and-compare programs in the quantum random oracle model [48.94443749859216]
  We introduce a quantum copy-protection scheme for a class of evasive functions known as " compute-and-compare programs" We prove that our scheme achieves non-trivial security against fully malicious adversaries in the quantum random oracle model (QROM) As a complementary result, we show that the same scheme fulfils a weaker notion of software protection, called "secure software leasing"
  arXiv  Detail & Related papers  (2020-09-29T08:41:53Z)
• Genuine Network Multipartite Entanglement [62.997667081978825]
  We argue that a source capable of distributing bipartite entanglement can, by itself, generate genuine $k$-partite entangled states for any $k$. We provide analytic and numerical witnesses of genuine network entanglement, and we reinterpret many past quantum experiments as demonstrations of this feature.
  arXiv  Detail & Related papers  (2020-02-07T13:26:00Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.