Violation of the $N$ -partite inequality introduced in Phys. Rev. Lett. 129, 150401 (2022) for genuine multipartite nonlocality under local operations and shared randomness (LOSR) rules out all causal-network models obtained by locally composing arbitrary resources involving at most $N-1$ parties, even when supplemented by shared randomness among all $N$ parties. Here, we demonstrate a device-independent self-test protocol for this. We further establish an analytic noise-robust self-test. For a Bell-score deficit $ε$ , we derive explicit $O(\sqrtε)$ vector-norm bounds for the state and the corresponding measurement actions.Violation of the $N$-partite inequality introduced in Phys. Rev. Lett. 129, 150401 (2022) for genuine multipartite nonlocality under local operations and shared randomness (LOSR) rules out all causal-network models obtained by locally composing arbitrary resources involving at most $N-1$ parties, even when supplemented by shared randomness among all $N$ parties. Here, we demonstrate a device-independent self-test protocol for this. We further establish an analytic noise-robust self-test. For a Bell-score deficit $ε$, we derive explicit $O(\sqrtε)$ vector-norm bounds for the state and the corresponding measurement actions.

quant-pharXiv:2609.15436Sep 15, 20260 citations

Randomness in distribution protocols

Carlo Blundo, Alfredo De Santis, Ugo Vaccaro

Lecture notes in computer scienceJan 1, 199422 citations

Efficient Card-Based Protocols with a Standard Deck of Playing Cards Using Partial Opening

Yoshiaki HONDA, Kazumasa SHINAGAWA

Card-based protocols are cryptographic protocols that use a deck of physical cards. In this paper, we deal with card-based protocols using a standard deck of playing cards, which are commonly and commercially available. For finite-runtime committed-format protocols, Mizuki (CANS 2016) proposed an eight-card AND protocol with four random bisection cuts and a six-card COPY protocol with one random bisection cut. In this paper, we propose a partial-open action, which reveals any position of the face of cards, by generalizing the half-open action introduced by Miyahara and Mizuki (IJTCS-FAW 2022). Using the partial-open action, we propose four-card AND protocols with three random cuts, a four-card COPY protocol with three random cuts, and a four-card base conversion protocol with a random cut. We note that, without partial-open actions, these AND and COPY protocols with random cuts only are known to be impossible to construct using four cards. Therefore, the partial-open actions are inherently necessary to obtain our results.Card-based protocols are cryptographic protocols that use a deck of physical cards. In this paper, we deal with card-based protocols using a standard deck of playing cards, which are commonly and commercially available. For finite-runtime committed-format protocols, Mizuki (CANS 2016) proposed an eight-card AND protocol with four random bisection cuts and a six-card COPY protocol with one random bisection cut. In this paper, we propose a partial-open action, which reveals any position of the face of cards, by generalizing the half-open action introduced by Miyahara and Mizuki (IJTCS-FAW 2022). Using the partial-open action, we propose four-card AND protocols with three random cuts, a four-card COPY protocol with three random cuts, and a four-card base conversion protocol with a random cut. We note that, without partial-open actions, these AND and COPY protocols with random cuts only are known to be impossible to construct using four cards. Therefore, the partial-open actions are inherently necessary to obtain our results.

IEICE Transactions on Fundamentals of Electronics Communications and Computer SciencesNov 24, 20250 citations

Simple Two-Message OT in the Explicit Isogeny Model

Emmanuela Orsini, Riccardo Zanotto

In this work we study algebraic and generic models for group actions, and extend them to the universal composability (UC) framework of Canetti (FOCS 2001). We revisit the constructions of Duman et al. (PKC 2023) integrating the type-safe model by Zhandry (Crypto 2022), adapted to the group action setting, and formally define an algebraic action model (AAM). This model restricts the power of the adversary in a similar fashion to the algebraic group model (AGM). By imposing algebraic behaviour to the adversary and environment of the UC framework, we construct the UC-AAM. Finally, we instantiate UC-AAM with isogeny-based assumptions, in particular the CSIDH action with twists, obtaining the explicit isogeny model, UC-EI; we observe that, under certain assumptions, this model is "closer" to standard UC than the UC-AGM, even though there still exists an important separation. We demonstrate the utility of our definitions by proving UC-EI security for the passive-secure oblivious transfer protocol described by Lai et al. (Eurocrypt 2021), hence providing the first concretely efficient two-message isogeny-based OT protocol in the random oracle model against malicious adversaries.In this work we study algebraic and generic models for group actions, and extend them to the universal composability (UC) framework of Canetti (FOCS 2001). We revisit the constructions of Duman et al. (PKC 2023) integrating the type-safe model by Zhandry (Crypto 2022), adapted to the group action setting, and formally define an algebraic action model (AAM). This model restricts the power of the adversary in a similar fashion to the algebraic group model (AGM). By imposing algebraic behaviour to the adversary and environment of the UC framework, we construct the UC-AAM. Finally, we instantiate UC-AAM with isogeny-based assumptions, in particular the CSIDH action with twists, obtaining the explicit isogeny model, UC-EI; we observe that, under certain assumptions, this model is "closer" to standard UC than the UC-AGM, even though there still exists an important separation. We demonstrate the utility of our definitions by proving UC-EI security for the passive-secure oblivious transfer protocol described by Lai et al. (Eurocrypt 2021), hence providing the first concretely efficient two-message isogeny-based OT protocol in the random oracle model against malicious adversaries.

IACR Communications in CryptologyApr 9, 20247 citations

Randomness in Distribution Protocols

Carlo Blundo, Alfredo De Santis, Ugo Vaccaro

Information and ComputationDec 1, 199637 citations

Violation of the

N

-partite inequality introduced in Phys. Rev. Lett. 129, 150401 (2022) for genuine multipartite nonlocality under local operations and shared randomness (LOSR) rules out all causal-network models obtained by locally composing arbitrary resources involving at most

N-1

parties, even when supplemented by shared randomness among all

N

parties. Here, we demonstrate a device-independent self-test protocol for this. We further establish an analytic noise-robust self-test. For a Bell-score deficit

ε

, we derive explicit

O(\sqrtε)

vector-norm bounds for the state and the corresponding measurement actions.