Struct fancy_garbling::Evaluator

pub struct Evaluator<C> { /* fields omitted */ }

Streaming evaluator using a callback to receive ciphertexts as needed.

Evaluates a garbled circuit on the fly, using messages containing ciphertexts and wires. Parallelizable.

Methods

impl<C: AbstractChannel> Evaluator<C>

pub fn new(channel: C) -> Self

Create a new Evaluator.

pub fn decode_output(&self) -> Result<Vec<u16>, EvaluatorError>

Decode the output received during the Fancy computation.

pub fn read_wire(&mut self, modulus: u16) -> Result<Wire, EvaluatorError>

Read a Wire from the reader.

Trait Implementations

impl<C: AbstractChannel> Fancy for Evaluator<C>

type Item = Wire

The underlying wire datatype created by an object implementing Fancy.

type Error = EvaluatorError

Errors which may be thrown by the users of Fancy.

fn constant(&mut self, _: u16, q: u16) -> Result<Wire, EvaluatorError>

Create a constant x with modulus q.

fn add(&mut self, x: &Wire, y: &Wire) -> Result<Wire, EvaluatorError>

Add x and y.

fn sub(&mut self, x: &Wire, y: &Wire) -> Result<Wire, EvaluatorError>

Subtract x and y.

fn cmul(&mut self, x: &Wire, c: u16) -> Result<Wire, EvaluatorError>

Multiply x times the constant c.

fn mul(&mut self, A: &Wire, B: &Wire) -> Result<Wire, EvaluatorError>

Multiply x and y.

fn proj(
    &mut self,
    x: &Wire,
    q: u16,
    _: Option<Vec<u16>>
) -> Result<Wire, EvaluatorError>

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

fn output(&mut self, x: &Wire) -> Result<(), EvaluatorError>

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.