Struct fancy_garbling::dummy::Dummy

pub struct Dummy { /* fields omitted */ }

Simple struct that performs the fancy computation over u16.

Methods

impl Dummy

pub fn new() -> Dummy

Create a new Dummy.

pub fn get_output(self) -> Vec<u16>

Get the output from the fancy computation, consuming the Dummy.

Trait Implementations

impl FancyInput for Dummy

fn encode(&mut self, value: u16, modulus: u16) -> Result<DummyVal, DummyError>

Encode a single dummy value.

fn encode_many(
    &mut self,
    xs: &[u16],
    moduli: &[u16]
) -> Result<Vec<DummyVal>, DummyError>

Encode a slice of inputs and a slice of moduli as DummyVals.

fn receive_many(&mut self, _moduli: &[u16]) -> Result<Vec<DummyVal>, DummyError>

Receive many values where the input is not known.

fn receive(&mut self, modulus: u16) -> Result<Self::Item, Self::Error>

Receive a single value.

fn encode_bundle(
    &mut self,
    values: &[u16],
    moduli: &[u16]
) -> Result<Bundle<Self::Item>, Self::Error>

Encode a bundle.

fn receive_bundle(
    &mut self,
    moduli: &[u16]
) -> Result<Bundle<Self::Item>, Self::Error>

Receive a bundle.

fn encode_bundles(
    &mut self,
    values: &[Vec<u16>],
    moduli: &[Vec<u16>]
) -> Result<Vec<Bundle<Self::Item>>, Self::Error>

Encode many input bundles.

fn receive_many_bundles(
    &mut self,
    moduli: &[Vec<u16>]
) -> Result<Vec<Bundle<Self::Item>>, Self::Error>

Receive many input bundles.

fn crt_encode(
    &mut self,
    value: u128,
    modulus: u128
) -> Result<CrtBundle<Self::Item>, Self::Error>

Encode a CRT input bundle.

fn crt_receive(
    &mut self,
    modulus: u128
) -> Result<CrtBundle<Self::Item>, Self::Error>

Receive an CRT input bundle.

fn crt_encode_many(
    &mut self,
    values: &[u128],
    modulus: u128
) -> Result<Vec<CrtBundle<Self::Item>>, Self::Error>

Encode many CRT input bundles.

fn crt_receive_many(
    &mut self,
    n: usize,
    modulus: u128
) -> Result<Vec<CrtBundle<Self::Item>>, Self::Error>

Receive many CRT input bundles.

fn bin_encode(
    &mut self,
    value: u128,
    nbits: usize
) -> Result<BinaryBundle<Self::Item>, Self::Error>

Encode a binary input bundle.

fn bin_receive(
    &mut self,
    nbits: usize
) -> Result<BinaryBundle<Self::Item>, Self::Error>

Receive an binary input bundle.

fn bin_encode_many(
    &mut self,
    values: &[u128],
    nbits: usize
) -> Result<Vec<BinaryBundle<Self::Item>>, Self::Error>

Encode many binary input bundles.

fn bin_receive_many(
    &mut self,
    ninputs: usize,
    nbits: usize
) -> Result<Vec<BinaryBundle<Self::Item>>, Self::Error>

Receive many binary input bundles.

impl Fancy for Dummy

type Item = DummyVal

The underlying wire datatype created by an object implementing Fancy.

type Error = DummyError

Errors which may be thrown by the users of Fancy.

fn constant(&mut self, val: u16, modulus: u16) -> Result<DummyVal, Self::Error>

Create a constant x with modulus q.

fn add(&mut self, x: &DummyVal, y: &DummyVal) -> Result<DummyVal, Self::Error>

Add x and y.

fn sub(&mut self, x: &DummyVal, y: &DummyVal) -> Result<DummyVal, Self::Error>

Subtract x and y.

fn cmul(&mut self, x: &DummyVal, c: u16) -> Result<DummyVal, Self::Error>

Multiply x times the constant c.

fn mul(&mut self, x: &DummyVal, y: &DummyVal) -> Result<DummyVal, Self::Error>

Multiply x and y.

fn proj(
    &mut self,
    x: &DummyVal,
    modulus: u16,
    tt: Option<Vec<u16>>
) -> Result<DummyVal, Self::Error>

Project x according to the truth table tt. Resulting wire has modulus q.

fn output(&mut self, x: &DummyVal) -> Result<(), Self::Error>

Process this wire as output.

fn add_many(&mut self, args: &[Self::Item]) -> Result<Self::Item, Self::Error>

Sum up a slice of wires.

fn xor(
    &mut self,
    x: &Self::Item,
    y: &Self::Item
) -> Result<Self::Item, Self::Error>

Xor is just addition, with the requirement that x and y are mod 2.

fn negate(&mut self, x: &Self::Item) -> Result<Self::Item, Self::Error>

Negate by xoring x with 1.

fn and(
    &mut self,
    x: &Self::Item,
    y: &Self::Item
) -> Result<Self::Item, Self::Error>

And is just multiplication, with the requirement that x and y are mod 2.

fn or(
    &mut self,
    x: &Self::Item,
    y: &Self::Item
) -> Result<Self::Item, Self::Error>

Or uses Demorgan's Rule implemented with multiplication and negation.

fn and_many(&mut self, args: &[Self::Item]) -> Result<Self::Item, Self::Error>

Returns 1 if all wires equal 1.

fn or_many(&mut self, args: &[Self::Item]) -> Result<Self::Item, Self::Error>

Returns 1 if any wire equals 1.

fn mod_change(
    &mut self,
    x: &Self::Item,
    to_modulus: u16
) -> Result<Self::Item, Self::Error>

Change the modulus of x to to_modulus using a projection gate.

fn adder(
    &mut self,
    x: &Self::Item,
    y: &Self::Item,
    carry_in: Option<&Self::Item>
) -> Result<(Self::Item, Self::Item), Self::Error>

Binary adder. Returns the result and the carry.

fn mux(
    &mut self,
    b: &Self::Item,
    x: &Self::Item,
    y: &Self::Item
) -> Result<Self::Item, Self::Error>

If b = 0 returns x else y.

fn mux_constant_bits(
    &mut self,
    x: &Self::Item,
    b1: bool,
    b2: bool
) -> Result<Self::Item, Self::Error>

If x = 0 returns the constant b1 else return b2. Folds constants if possible.

fn outputs(&mut self, xs: &[Self::Item]) -> Result<(), Self::Error>

Output a slice of wires.