AND Protocols Using Only Uniform Shuffles

10/01/2018
by   Suthee Ruangwises, et al.
0

Secure multi-party computation using a deck of playing cards has been a subject of research since the "five-card trick" introduced by den Boer in 1989. One of the main problems in card-based cryptography is to design committed-format protocols to compute a Boolean AND operation subject to different runtime and shuffle restrictions by using as few cards as possible. In this paper, we introduce two AND protocols that use only uniform shuffles. The first one requires four cards and is a restart-free Las Vegas protocol with finite expected runtime. The second one requires five cards and always terminates in finite time.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/05/2020

Using Five Cards to Encode Each Integer in ℤ/6ℤ

Research in secure multi-party computation using a deck of playing cards...
research
06/23/2023

The Landscape of Computing Symmetric n-Variable Functions with 2n Cards

Secure multi-party computation using a physical deck of cards, often cal...
research
11/14/2019

Securely Computing the n-Variable Equality Function with 2n Cards

Research on the area of secure multi-party computation using a deck of p...
research
10/16/2020

Barrington Plays Cards: The Complexity of Card-based Protocols

In this paper we study the computational complexity of functions that ha...
research
12/09/2020

Secure Medical Image Analysis with CrypTFlow

We present CRYPTFLOW, a system that converts TensorFlow inference code i...
research
02/23/2023

A Survey of Secure Computation Using Trusted Execution Environments

As an essential technology underpinning trusted computing, the trusted e...
research
07/02/2023

On the Runtime of Chemical Reaction Networks Beyond Idealized Conditions

This paper studies the (discrete) chemical reaction network (CRN) comput...

Please sign up or login with your details

Forgot password? Click here to reset