Two-Round MPC: Information-Theoretic and Black-Box

Theory of Cryptography - Lecture Notes in Computer Science ◽

10.1007/978-3-030-03807-6_5 ◽

2018 ◽

pp. 123-151 ◽

Cited By ~ 4

Author(s):

Sanjam Garg ◽

Yuval Ishai ◽

Akshayaram Srinivasan

Keyword(s):

Black Box ◽

Information Theoretic

Download Full-text

Information Theoretic Analysis for Input Vector Selection in Black Box Modeling

Dynamic Systems and Control ◽

10.1115/imece2002-33451 ◽

2002 ◽

Author(s):

Brett Martin ◽

Peter H. Meckl ◽

Benjamin J. Zwissler

Keyword(s):

Model Building ◽

Mean Squared Error ◽

Black Box ◽

Input Vector ◽

Data Sets ◽

Theoretic Analysis ◽

Validation Data ◽

Information Theoretic ◽

Past Data ◽

The Relationship

When developing a black box model, the precise functional relationship between inputs and output is unknown. Engineers and scientists have turned to various regression tools in order to effectively capture the relationship based on past data observations. When modeling this data, however, it is important to only use inputs that provide information about the output. This paper presents a method of selecting the most informational input vectors for use in regression model building. This information-theoretic analysis for input vector selection requires only past data observations. Experimental results show that models built on the most informational input vectors produce less mean squared error on both training and validation data sets.

Download Full-text

Revisiting and Improving Algorithms for the 3XOR Problem

IACR Transactions on Symmetric Cryptology ◽

10.46586/tosc.v2018.i1.254-276 ◽

2018 ◽

pp. 254-276

Author(s):

Charles Bouillaguet ◽

Claire Delaplace ◽

Pierre-Alain Fouque

Keyword(s):

Black Box ◽

Specific Form ◽

Point Of View ◽

Difficult Case ◽

Huge Amount ◽

Information Theoretic ◽

Random Functions ◽

Geometric Problems ◽

Birthday Problem ◽

Theoretic Point

The 3SUM problem is a well-known problem in computer science and many geometric problems have been reduced to it. We study the 3XOR variant which is more cryptologically relevant. In this problem, the attacker is given black-box access to three random functions F,G and H and she has to find three inputs x, y and z such that F(x) ⊕ G(y) ⊕ H(z) = 0. The 3XOR problem is a difficult case of the more-general k-list birthday problem. Wagner’s celebrated k-list birthday algorithm, and the ones inspired by it, work by querying the functions more than strictly necessary from an information-theoretic point of view. This gives some leeway to target a solution of a specific form, at the expense of processing a huge amount of data. However, to handle such a huge amount of data can be very difficult in practice. This is why we first restricted our attention to solving the 3XOR problem for which the total number of queries to F, G and H is minimal. If they are n-bit random functions, it is possible to solve the problem with roughly

Download Full-text