MOTION
0.01
Framework for mixed-protocol multi-party computation
|
Go to the documentation of this file.
29 #include <unordered_map>
46 std::size_t bitlength);
48 std::size_t number_of_blocks);
50 std::size_t number_of_blocks);
57 using KeysType = std::pair<std::size_t, ReusableFiberPromise<Block128Vector>>;
61 using GarbledRowsType = std::pair<std::size_t, ReusableFiberPromise<Block128Vector>>;
std::pair< std::size_t, ReusableFiberPromise< Block128Vector > > GarbledRowsType
Definition: bmr_data.h:61
Definition: reusable_future.h:129
std::pair< std::size_t, ReusableFiberPromise< Block128Vector > > KeysType
Definition: bmr_data.h:57
std::unordered_map< std::size_t, InputPublicValueType > input_public_value_promises_
Definition: bmr_data.h:54
type
Definition: geninput.py:149
ReusableFuture< R, MutexType, ConditionVariableType > get_future()
Definition: reusable_future.h:242
std::pair< std::size_t, ReusableFiberPromise< BitVector<> >> InputPublicValueType
Definition: bmr_data.h:53
Vector of 128 bit / 16 B blocks.
Definition: block.h:168
void MessageReceived(const std::uint8_t *message, const DataType type, const std::size_t i)
Definition: bmr_data.cpp:30
DataType
Definition: bmr_data.h:39
ReusableFiberFuture< Block128Vector > RegisterForInputPublicKeys(std::size_t gate_id, std::size_t number_of_blocks)
Definition: bmr_data.cpp:79
ReusableFiberFuture< BitVector<> > RegisterForInputPublicValues(std::size_t gate_id, std::size_t bitlength)
Definition: bmr_data.cpp:65
ReusableFiberFuture< Block128Vector > RegisterForGarbledRows(std::size_t gate_id, std::size_t number_of_blocks)
Definition: bmr_data.cpp:93
@ kInputStep0
Definition: bmr_data.h:39
std::unordered_map< std::size_t, KeysType > input_public_key_promises_
Definition: bmr_data.h:58
void Reset()
Definition: bmr_data.cpp:59
Definition: bmr_data.h:41
@ kAndGate
Definition: bmr_data.h:39
Definition: reusable_future.h:123
@ kInputStep1
Definition: bmr_data.h:39
std::unordered_map< std::size_t, GarbledRowsType > garbled_rows_promises_
Definition: bmr_data.h:62