scholarly journals Minimum Round Card-Based Cryptographic Protocols Using Private Operations

Cryptography ◽  
2021 ◽  
Vol 5 (3) ◽  
pp. 17
Author(s):  
Hibiki Ono ◽  
Yoshifumi Manabe
Keyword(s):  
Boolean Functions ◽  
Cryptographic Protocols ◽  
Secure Multiparty Computation ◽  
The Other ◽  
Multiparty Computation ◽  
Minimum Number

This paper shows new card-based cryptographic protocols with the minimum number of rounds, using private operations under the semi-honest model. Physical cards are used in card-based cryptographic protocols instead of computers to achieve secure multiparty computation. Operations that a player executes in a place where the other players cannot see are called private operations. Using three private operations—private random bisection cuts, private reverse cuts, and private reveals—the calculations of two variable Boolean functions and copy operations were realized with the minimum number of cards. Though the number of cards has been discussed, the efficiency of these protocols has not been discussed. This paper defines the number of rounds to evaluate the efficiency of the protocols, using private operations. Most of the meaningful calculations using private operations need at least two rounds. This paper presents a new two-round committed-input, committed-output logical XOR protocol, using four cards. Then, we show new two-round committed-input, committed-output logical AND and copy protocols, using six cards. Even if private reveal operations are not used, logical XOR, logical AND, and copy operations can be executed with the minimum number of rounds. Protocols for general n-variable Boolean functions and protocols that preserve an input are also shown. Lastly, protocols with asymmetric cards are shown.

scholarly journals Card-Based Cryptographic Logical Computations Using Private Operations

2020 ◽  
Author(s):  
Hibiki Ono ◽  
Yoshifumi Manabe
Keyword(s):  
Cryptographic Protocols ◽  
The Other ◽  
General Logic ◽  
Private Values ◽  
Minimum Number ◽  
Logic Functions ◽  
Logical Functions

Abstract This paper proposes new card-based cryptographic protocols to calculate logic functions with the minimum number of cards using private operations under the semi-honest model. Though various card-based cryptographic protocols were shown, the minimum number of cards used in the protocol has not been achieved yet for many problems. Operations executed by a player where the other players cannot see are called private operations. Private operations have been introduced in some protocols to solve a particular problem or to input private values. However, the effectiveness of introducing private operations to the calculation of general logic functions has not been considered. This paper introduces three new private operations: private random bisection cuts, private reverse cuts, and private reveals. With these three new operations, we show that all of AND, XOR, and copy protocols are achieved with the minimum number of cards by simple three-round protocols. This paper then shows a protocol to calculate any logical functions using these private operations. Next, we consider protocols with malicious players.

Quantum Secure Multiparty Computation with Symmetric Boolean Functions

2020 ◽  
Vol 37 (5) ◽  
pp. 050303
Author(s):  
Hao Cao ◽  
Wenping Ma ◽  
Ge Liu ◽  
Liangdong Lü ◽  
Zheng-Yuan Xue
Keyword(s):  
Boolean Functions ◽  
Secure Multiparty Computation ◽  
Multiparty Computation ◽  
Symmetric Boolean Functions

Secure multiparty computation solutions of collection member decision

2013 ◽  
Vol 33 (12) ◽  
pp. 3527-3530
Author(s):  
Yongli DOU ◽  
Haichun WANG ◽  
Jian KANG
Keyword(s):  
Secure Multiparty Computation ◽  
Multiparty Computation

On 1-stable perfectly balanced Boolean functions

2017 ◽  
Vol 27 (2) ◽  
Author(s):  
Stanislav V. Smyshlyaev
Keyword(s):  
Boolean Function ◽  
Boolean Functions ◽  
The Other ◽  
Correlation Immunity ◽  
Other Hand

AbstractThe paper is concerned with relations between the correlation-immunity (stability) and the perfectly balancedness of Boolean functions. It is shown that an arbitrary perfectly balanced Boolean function fails to satisfy a certain property that is weaker than the 1-stability. This result refutes some assertions by Markus Dichtl. On the other hand, we present new results on barriers of perfectly balanced Boolean functions which show that any perfectly balanced function such that the sum of the lengths of barriers is smaller than the length of variables, is 1-stable.

scholarly journals Efficient Secure Multiparty Computation Protocol for Sequencing Problem over Insecure Channel

2013 ◽  
Vol 2013 ◽  
pp. 1-5 ◽  
Author(s):  
Yi Sun ◽  
Qiaoyan Wen ◽  
Yudong Zhang ◽  
Hua Zhang ◽  
Zhengping Jin
Keyword(s):  
Homomorphic Encryption ◽  
Privacy Preserving ◽  
Secure Multiparty Computation ◽  
Online Auction ◽  
Multiparty Computation ◽  
Sequencing Problem ◽  
The Core ◽  
Secure Protocol ◽  
Core Issue

As a powerful tool in solving privacy preserving cooperative problems, secure multiparty computation is more and more popular in electronic bidding, anonymous voting, and online auction. Privacy preserving sequencing problem which is an essential link is regarded as the core issue in these applications. However, due to the difficulties of solving multiparty privacy preserving sequencing problem, related secure protocol is extremely rare. In order to break this deadlock, this paper first presents an efficient secure multiparty computation protocol for the general privacy-preserving sequencing problem based on symmetric homomorphic encryption. The result is of value not only in theory, but also in practice.

Two-Round Adaptively Secure Multiparty Computation from Standard Assumptions

2018 ◽  
pp. 175-205 ◽  
Author(s):  
Fabrice Benhamouda ◽  
Huijia Lin ◽  
Antigoni Polychroniadou ◽  
Muthuramakrishnan Venkitasubramaniam
Keyword(s):  
Secure Multiparty Computation ◽  
Multiparty Computation

scholarly journals A proposal of privacy preserving reinforcement learning for secure multiparty computation

2017 ◽  
Vol 6 (2) ◽  
pp. 57 ◽  
Author(s):  
Hirofumi Miyajima ◽  
Noritaka Shigei ◽  
Syunki Makino ◽  
Hiromi Miyajima ◽  
Yohtaro Miyanishi ◽  
...  
Keyword(s):  
Reinforcement Learning ◽  
Distributed Processing ◽  
Data Encryption ◽  
Secure Multiparty Computation ◽  
Multiparty Computation ◽  
Learning Methods ◽  
Q Learning ◽  
Encryption And Decryption ◽  
Maze Problem ◽  
Learning Data

Many studies have been done with the security of cloud computing. Though data encryption is a typical approach, high computing complexity for encryption and decryption of data is needed. Therefore, safe system for distributed processing with secure data attracts attention, and a lot of studies have been done. Secure multiparty computation (SMC) is one of these methods. Specifically, two learning methods for machine learning (ML) with SMC are known. One is to divide learning data into several subsets and perform learning. The other is to divide each item of learning data and perform learning. So far, most of works for ML with SMC are ones with supervised and unsupervised learning such as BP and K-means methods. It seems that there does not exist any studies for reinforcement learning (RL) with SMC. This paper proposes learning methods with SMC for Q-learning which is one of typical methods for RL. The effectiveness of proposed methods is shown by numerical simulation for the maze problem.

Sign in / Sign up

Export Citation Format

Share Document