A Note on Single-Cut Full-Open Protocols

• URL: http://arxiv.org/abs/2507.03323v1
• Date: Fri, 04 Jul 2025 06:17:52 GMT
• Title: A Note on Single-Cut Full-Open Protocols
• Abstract summary: A single-cut full-open protocol is one that obtains an output value by applying a random cut to an input sequence of cards, after which all cards are opened.<n>We propose three single-cut full-open protocols: two protocols for three-variable functions and one protocol for a four-variable function.
• Score: 0.36832029288386137
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Card-based cryptography is a research area that realizes cryptographic protocols such as secure computation by applying shuffles to sequences of cards that encode input values. A single-cut full-open protocol is one that obtains an output value by applying a random cut to an input sequence of cards, after which all cards are opened. In this paper, we propose three single-cut full-open protocols: two protocols for three-variable functions and one protocol for a four-variable function.

Related papers

• Quantum secure blind decryption with two users [41.41659382286553]
  We propose two types of protocols for quantum secure blind decryption.<n>Users ensure the secrecy of the text from the servers.<n>Servers maintain the secrecy of the keys from the users.
  arXiv  Detail & Related papers  (2026-06-01T09:10:00Z)
• Single-Shuffle Full-Open Card-Based Protocols for Any Function [4.039245878626346]
  A textitsingle-shuffle full-open protocol is a minimal model of card-based secure computation.<n>We prove for the first time that every function admits a single-shuffle full-open protocol.
  arXiv  Detail & Related papers  (2025-10-20T08:52:23Z)
• Computational Monogamy of Entanglement and Non-Interactive Quantum Key Distribution [21.219588497290115]
  Quantum key distribution (QKD) enables Alice and Bob to exchange a secret key over a public, untrusted quantum channel.<n>Compared to classical key exchange, QKD achieves everlasting security: after the protocol execution the key is secure against adversaries.<n>No non-interactive protocol is known that provides everlasting security, even using quantum information.
  arXiv  Detail & Related papers  (2025-10-01T11:41:04Z)
• Provably Secure Public-Key Steganography Based on Admissible Encoding [66.38591467056939]
  The technique of hiding secret messages within seemingly harmless covertext is known as provably secure steganography (PSS)<n>PSS evolves from symmetric key steganography to public-key steganography, functioning without the requirement of a pre-shared key.<n>This paper proposes a more general elliptic curve public key steganography method based on admissible encoding.
  arXiv  Detail & Related papers  (2025-04-28T03:42:25Z)
• Secure Aggregation in Federated Learning using Multiparty Homomorphic Encryption [17.98928470989766]
  A key operation in federated learning is the aggregation of gradient vectors generated by individual client nodes.<n>We develop a method based on multiparty homomorphic encryption (MPHE) that enables the central node to compute this aggregate.<n>We extend classical MPHE methods so that the decryption of the aggregate vector can be successful even when only a subset of client nodes are available.
  arXiv  Detail & Related papers  (2025-03-01T18:19:25Z)
• Quantum cryptographic protocols with dual messaging system via 2D alternate quantum walk of a genuine single-photon entangled state [0.0]
  A single-photon entangled state (SPES) can offer a more secure way of encoding and processing quantum information than their multi-photon (or multi-particle) counterparts. This letter shows that the generated genuine three-way and nonlocal two-way SPES can be used as cryptographic keys to securely encode two distinct messages simultaneously.
  arXiv  Detail & Related papers  (2024-05-01T17:50:36Z)
• Card-Based Overwriting Protocol for Equality Function and Applications [0.34952465649465553]
  Research in the area of secure multi-party computation with an unconventional method of using a physical deck of playing cards began in 1989. We propose a card-based protocol called the overwriting protocol that can securely compute the $k$-candidate $n$-variable equality function.
  arXiv  Detail & Related papers  (2024-02-26T04:13:51Z)
• A Novel Scalable Quantum Protocol for the Dining Cryptographers Problem [0.0]
  The protocol supports an arbitrary number of cryptographers $n$, enabling scalability in both participant count and the volume of anonymous information transmitted. The protocol ensures uniformity by requiring all cryptographers to utilize identical private quantum circuits.
  arXiv  Detail & Related papers  (2024-01-30T02:05:38Z)
• Quantum Two-Way Protocol Beyond Superdense Coding: Joint Transfer of Data and Entanglement [33.2699333323263]
  We introduce a generalization of one-way superdense coding to two-way communication protocols for transmitting classical bits by using entangled quantum pairs.<n>The proposed protocol jointly addresses the provision of entangled pairs and superdense coding, introducing an integrated approach for managing entanglement within the communication protocol.<n>We present the results of implementing the protocol in a computer simulation based on the NetSquid framework.
  arXiv  Detail & Related papers  (2023-09-06T08:48:07Z)
• Secure multiparty quantum computations for greatest common divisor and private set intersection [2.5204420653245245]
  We present a secure multiparty quantum computation (MPQC) for computing greatest common divisor (GCD) based on quantum multiparty private set union (PSU) by Liu, Yang, and Li.
  arXiv  Detail & Related papers  (2023-03-30T07:33:30Z)
• One-Time Universal Hashing Quantum Digital Signatures without Perfect Keys [24.240914319917053]
  We show that imperfect quantum keys with limited information leakage can be used for digital signatures and authentication without compromising security. This study significantly reduces the delay for data postprocessing and is compatible with any quantum key generation protocols.
  arXiv  Detail & Related papers  (2023-01-03T14:54:27Z)
• Automated Attack Synthesis by Extracting Finite State Machines from Protocol Specification Documents [25.871916915930996]
  We suggest a data-driven approach for extracting finite state machines (FSMs) from RFC documents. Unlike off-the-shelf NLP tools, we suggest a data-driven approach for extracting FSMs from RFC documents. We show the generalizability of our FSM extraction by using RFCs for six different protocols: BGPv4, DCCP,. SCTP and TCP.
  arXiv  Detail & Related papers  (2022-02-18T23:27:29Z)
• Composably secure data processing for Gaussian-modulated continuous variable quantum key distribution [58.720142291102135]
  Continuous-variable quantum key distribution (QKD) employs the quadratures of a bosonic mode to establish a secret key between two remote parties. We consider a protocol with homodyne detection in the general setting of composable finite-size security. In particular, we analyze the high signal-to-noise regime which requires the use of high-rate (non-binary) low-density parity check codes.
  arXiv  Detail & Related papers  (2021-03-30T18:02:55Z)
• Quantum Secure Direct Communication with Mutual Authentication using a Single Basis [2.9542356825059715]
  We propose a new theoretical scheme for quantum secure direct communication (QSDC) with user authentication. The present protocol uses only one orthogonal basis of single-qubit states to encode the secret message. We discuss the security of the proposed protocol against some common attacks and show that no eaves-dropper can get any information from the quantum and classical channels.
  arXiv  Detail & Related papers  (2021-01-10T16:32:42Z)
• Counterfactual Concealed Telecomputation [22.577469136318836]
  We devise a distributed blind quantum computation protocol to perform a universal two-qubit controlled unitary operation. It is shown that the protocol is valid for general input states and that single-qubit unitary teleportation is a special case of CCT. The protocol becomes deterministic with simplified circuit implementation if the initial composite state of Alice and Bob is a Bell-type state.
  arXiv  Detail & Related papers  (2020-12-09T10:07:58Z)
• Oblivious Transfer is in MiniQCrypt [20.72168448608258]
  MiniQCrypt is a world where quantum-secure one-way functions exist, and quantum communication is possible. We construct an oblivious transfer protocol in MiniQCrypt that achieves simulation-security in the plain model against malicious quantum-time adversaries.
  arXiv  Detail & Related papers  (2020-11-30T16:51:17Z)
• Twin-field quantum digital signatures [4.503555294002338]
  Digital signature is a key technique in information security, especially for identity authentications. Quantum digital signatures (QDSs) provide a considerably higher level of security, i.e., information-theoretic security.
  arXiv  Detail & Related papers  (2020-03-25T08:04:59Z)

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.