Secure two-party computation method and system based on symbol boundary value binary decision diagram

A technology for secure two-party computation and binary decision graph, applied in the field of information security, can solve problems such as state space explosion, function scale expansion, etc., to achieve the effect of improving computing efficiency and providing controllability

Active Publication Date: 2015-05-13
GUILIN UNIV OF ELECTRONIC TECH
View PDF3 Cites 12 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, with the increase of elements in the finite field, the scale of the d...

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Secure two-party computation method and system based on symbol boundary value binary decision diagram
  • Secure two-party computation method and system based on symbol boundary value binary decision diagram
  • Secure two-party computation method and system based on symbol boundary value binary decision diagram

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0087] When input: represents the joint function f(x 1 ,x 2 ,...,x n ) of EVBDD(f), where the variable order is x 1 2 n . In addition, the server's input x a =(x 1 ,x 2 ,...,x k ) corresponds to the first k variables in EVBDD(f), the input x of the client b Corresponding to the last n-k variables. Expected output: C=f(x a ,x b ).

[0088] figure 1 An example model for this embodiment. figure 2 It is the embodiment flowchart of this embodiment. refer to figure 2 , a kind of safe two-party computing method based on symbol EVBDD that the present invention proposes, comprises following three phases, and namely phase I (offline) server builds and confuses joint function; Phase II (online) information interaction between server and client; Phase III The client's decryption calculation. The specific steps of each stage above are:

[0089] Phase I (offline) server builds obfuscated joint functions, including:

[0090] Step 1, the server randomly generates a label l...

Embodiment 2

[0179] This embodiment provides And-N: bitwise AND operation of two integers, the server and the client each hold an input of an N-bits integer, and the output is an N-bits integer.

[0180] Step 1. The server confuses the joint function and assigns labels, node keys and value keys.

[0181] Step 2, client-server information interaction, obfuscation of input data and acquisition of key tags required for decryption.

[0182] Step 3, the client decrypts the calculation and obtains the final result.

[0183] With the increase of elements in the finite field, the number of leaf nodes of the joint function will change in different representations. For this reason, we set N=4, 8, 16, and made horizontal and vertical comparisons in the two functions respectively.

[0184] Figure 4 It is the complexity analysis before encryption of the And-N joint function in this embodiment. The analysis shows that when the number of elements in the finite field is large, the size of the joint f...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses a secure two-party computation method and a secure two-party computation system based on a symbol boundary value binary decision diagram. The secure two-party computation method comprises three stages, namely a stage of constructing a local ambiguity sub joint function though a server, a stage of interacting information between the server and a client side, and a decryption computation stage of the client side. According to the secure two-party computation method, the function ambiguity and the client-side input data ambiguity are jointed through the server, so that privacy protection to function scale, internal structure and input data is realized; through an EVBDD symbol describing and node encryption-decryption algorithm, the execution efficiency of the secure two-party computation is improved. The secure two-party computation method can be used for safely completing a strategy execution function of parties to a joint task under relatively high algorithm efficiency; meanwhile, the safety strategy of the joint task and the encryption data in the computation process are guaranteed to be not leaked.

Description

technical field [0001] The present invention relates to the field of information security, in particular to a secure two-party computing method and system based on a symbolic edge-valued binary decision diagram (Edge-Valued Binary Decision Diagram, EVBDD). Background technique [0002] The concept of secure multi-party computing was first proposed by Professor Yao Qizhi, a Chinese computer scientist and Turing Award winner. Yao Qizhi vividly explained the secure multi-party computing through the "Millionaire Problem", that is, how to calculate which of two millionaires is richer under the premise of protecting the amount of each other's assets from the other party through a security protocol. Secure multi-party computing is mainly used to study the joint computing problem between a group of mutually distrusting parties under the premise of protecting private information. The basic requirement is to ensure the efficiency, privacy and correctness of computing. [0003] With t...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): H04L29/06H04L9/08
Inventor 古天龙俞强生徐周波常亮宁黎华
Owner GUILIN UNIV OF ELECTRONIC TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products