Struct clacc::Accumulator

source ·
pub struct Accumulator<T: BigInt, M: Map> { /* private fields */ }
Expand description

An accumulator.

Elements may be added and deleted from the acculumator without increasing the size of its internal parameters. That is, the number of digits in the accumulation z will never exceed the number of digits in the modulus n.

Implementations§

source§

impl<T: BigInt, M: Map> Accumulator<T, M>

source

pub fn with_private_key(p: T, q: T) -> Self

Initialize an accumulator from private key parameters. All accumulators are able to add elements and verify witnesses. An accumulator constructed from a private key is able to delete elements and prove elements after their addition.

use clacc::{
    Accumulator,
    blake2::Map,
};
use num_bigint::BigInt;
let p = vec![0x3d];
let q = vec![0x35];
let acc = Accumulator::<BigInt, Map>::with_private_key(
    <BigInt as clacc::BigInt>::from_bytes_be(p.as_slice()),
    <BigInt as clacc::BigInt>::from_bytes_be(q.as_slice()),
);
source

pub fn with_random_key<F: FnMut(&mut [u8])>( fill_bytes: F, key_bits: Option<usize> ) -> (Self, T, T)

Create an accumulator from a randomly generated private key and return it along with the generated key parameters.

If key_bits is None, the bit size of the generated modulus is 3072.

use clacc::{
    Accumulator,
    blake2::Map,
    BigInt as BigIntTrait,
};
use num_bigint::BigInt;
use rand::RngCore;
let mut rng = rand::thread_rng();
let acc = Accumulator::<BigInt, Map>::with_random_key(
    |bytes| rng.fill_bytes(bytes),
    Some(256),
).0;
assert_eq!(acc.get_public_key().size_in_bits(), 256);
source

pub fn with_public_key(n: T) -> Self

Initialize an accumulator from a public key. An accumulator constructed from a public key is only able to add elements and verify witnesses.

use clacc::{
    Accumulator,
    blake2::Map,
};
use num_bigint::BigInt;
let n = vec![0x0c, 0xa1];
let acc = Accumulator::<BigInt, Map>::with_public_key(
   <BigInt as clacc::BigInt>::from_bytes_be( n.as_slice()),
);
source

pub fn get_public_key(&self) -> T

Get an accumulator’s public key.

use clacc::{
    Accumulator,
    blake2::Map,
};
use num_bigint::BigInt;
let p = vec![0x3d];
let q = vec![0x35];
let n = vec![0x0c, 0xa1];
let mut acc = Accumulator::<BigInt, Map>::with_private_key(
    <BigInt as clacc::BigInt>::from_bytes_be(p.as_slice()),
    <BigInt as clacc::BigInt>::from_bytes_be(q.as_slice()),
);
assert_eq!(
  acc.get_public_key(),
  <BigInt as clacc::BigInt>::from_bytes_be(n.as_slice()),
);
source

pub fn add<'a, V: 'a + Clone + Into<Vec<u8>>>(&mut self, v: &'a V) -> Witness<T>

Add an element to an accumulator.

use clacc::{
    Accumulator,
    blake2::Map,
};
use num_bigint::BigInt;
let n = vec![0x0c, 0xa1];
let mut acc = Accumulator::<BigInt, Map>::with_public_key(
    <BigInt as clacc::BigInt>::from_bytes_be(n.as_slice()),
);
let x = b"abc".to_vec();
let w = acc.add(&x);
assert!(acc.verify(&x, &w).is_ok());

This works with accumulators constructed from a public key or a private key.

use clacc::{
    Accumulator,
    blake2::Map,
};
use num_bigint::BigInt;
let p = vec![0x3d];
let q = vec![0x35];
let mut acc = Accumulator::<BigInt, Map>::with_private_key(
    <BigInt as clacc::BigInt>::from_bytes_be(p.as_slice()),
    <BigInt as clacc::BigInt>::from_bytes_be(q.as_slice()),
);
let x = b"abc".to_vec();
let w = acc.add(&x);
assert!(acc.verify(&x, &w).is_ok());
source

pub fn del<'a, V: 'a + Clone + Into<Vec<u8>>>( &mut self, v: &'a V, w: &Witness<T> ) -> Result<T, Error>

Delete an element from an accumulator.

use clacc::{
    Accumulator,
    blake2::Map,
};
use num_bigint::BigInt;
let p = vec![0x3d];
let q = vec![0x35];
let mut acc = Accumulator::<BigInt, Map>::with_private_key(
    <BigInt as clacc::BigInt>::from_bytes_be(p.as_slice()),
    <BigInt as clacc::BigInt>::from_bytes_be(q.as_slice()),
);
let x = b"abc".to_vec();
let w = acc.add(&x);
assert!(acc.del(&x, &w).is_ok());
assert!(acc.verify(&x, &w).is_err());
assert!(acc.del(&x, &w).is_err());

This will only succeed with an accumulator constructed from a private key.

use clacc::{
    Accumulator,
    blake2::Map,
};
use num_bigint::BigInt;
let n = vec![0x0c, 0xa1];
let mut acc = Accumulator::<BigInt, Map>::with_public_key(
    <BigInt as clacc::BigInt>::from_bytes_be(n.as_slice())
);
let x = b"abc".to_vec();
let w = acc.add(&x);
assert!(acc.del(&x, &w).is_err());
source

pub fn prove<'a, V: 'a + Clone + Into<Vec<u8>>>( &self, v: &'a V ) -> Result<Witness<T>, Error>

Generate a witness to an element’s addition to the accumulation.

use clacc::{
    Accumulator,
    blake2::Map,
};
use num_bigint::BigInt;
let p = vec![0x3d];
let q = vec![0x35];
let mut acc = Accumulator::<BigInt, Map>::with_private_key(
    <BigInt as clacc::BigInt>::from_bytes_be(p.as_slice()),
    <BigInt as clacc::BigInt>::from_bytes_be(q.as_slice()),
);
let x = b"abc".to_vec();
acc.add(&x);
let w = acc.prove(&x).unwrap();
assert!(acc.verify(&x, &w).is_ok());

This will only succeed with an accumulator constructed from a private key.

use clacc::{
    Accumulator,
    blake2::Map,
};
use num_bigint::BigInt;
let n = vec![0x0c, 0xa1];
let mut acc = Accumulator::<BigInt, Map>::with_public_key(
    <BigInt as clacc::BigInt>::from_bytes_be(n.as_slice()),
);
let x = b"abc".to_vec();
acc.add(&x);
assert!(acc.prove(&x).is_err());
source

pub fn verify<'a, V: 'a + Clone + Into<Vec<u8>>>( &self, v: &'a V, w: &Witness<T> ) -> Result<(), Error>

Verify an element is a member of an accumulator.

use clacc::{
    Accumulator,
    blake2::Map,
};
use num_bigint::BigInt;
let n = vec![0x0c, 0xa1];
let mut acc = Accumulator::<BigInt, Map>::with_public_key(
    <BigInt as clacc::BigInt>::from_bytes_be(n.as_slice()),
);
let x = b"abc".to_vec();
let w = acc.add(&x);
assert!(acc.verify(&x, &w).is_ok());

This works with accumulators constructed from a public key or a private key.

use clacc::{
    Accumulator,
    blake2::Map,
};
use num_bigint::BigInt;
let p = vec![0x3d];
let q = vec![0x35];
let mut acc = Accumulator::<BigInt, Map>::with_private_key(
    <BigInt as clacc::BigInt>::from_bytes_be(p.as_slice()),
    <BigInt as clacc::BigInt>::from_bytes_be(q.as_slice()),
);
let x = b"abc".to_vec();
let w = acc.add(&x);
assert!(acc.verify(&x, &w).is_ok());
source

pub fn get_value(&self) -> T

Return the accumulation value as a BigInt.

use clacc::{
    Accumulator,
    Witness,
    blake2::Map,
};
use num_bigint::BigInt;
let n = vec![0x0c, 0xa1];
let mut acc = Accumulator::<BigInt, Map>::with_public_key(
    <BigInt as clacc::BigInt>::from_bytes_be(n.as_slice()),
);
let x = b"abc".to_vec();
let y = b"def".to_vec();
// Add an element.
acc.add(&x);
// Save the current accumulation. This value is effectively
// a witness for the next element added.
let u = acc.get_value().clone();
// Add another element.
let nonce = acc.add(&y).nonce;
let w = Witness {
    u: u,
    nonce: nonce,
};
// Verify that `w` is a witness for `y`.
assert!(acc.verify(&y, &w).is_ok());
source

pub fn set_value(&mut self, z: T)

Set the accumulation value from a BigInt.

use clacc::{
    Accumulator,
    blake2::Map,
};
use num_bigint::BigInt;
let p = vec![0x3d];
let q = vec![0x35];
let mut acc_prv = Accumulator::<BigInt, Map>::with_private_key(
    <BigInt as clacc::BigInt>::from_bytes_be(p.as_slice()),
    <BigInt as clacc::BigInt>::from_bytes_be(q.as_slice()),
);
let n = vec![0x0c, 0xa1];
let mut acc_pub = Accumulator::<BigInt, Map>::with_public_key(
    <BigInt as clacc::BigInt>::from_bytes_be(n.as_slice()),
);
let x = b"abc".to_vec();
let w = acc_prv.add(&x);
acc_pub.set_value(acc_prv.get_value());
assert!(acc_prv.verify(&x, &w).is_ok());

Trait Implementations§

source§

impl<T: Clone + BigInt, M: Clone + Map> Clone for Accumulator<T, M>

source§

fn clone(&self) -> Accumulator<T, M>

Returns a copy of the value. Read more
1.0.0 · source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more

Auto Trait Implementations§

§

impl<T, M> RefUnwindSafe for Accumulator<T, M>where M: RefUnwindSafe, T: RefUnwindSafe,

§

impl<T, M> Send for Accumulator<T, M>where M: Send,

§

impl<T, M> Sync for Accumulator<T, M>where M: Sync,

§

impl<T, M> Unpin for Accumulator<T, M>where M: Unpin, T: Unpin,

§

impl<T, M> UnwindSafe for Accumulator<T, M>where M: UnwindSafe, T: UnwindSafe,

Blanket Implementations§

source§

impl<T> Any for Twhere T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for Twhere T: ?Sized,

const: unstable · source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for Twhere T: ?Sized,

const: unstable · source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
§

impl<T> Conv for T

§

fn conv<T>(self) -> Twhere Self: Into<T>,

Converts self into T using Into<T>. Read more
§

impl<T> FmtForward for T

§

fn fmt_binary(self) -> FmtBinary<Self>where Self: Binary,

Causes self to use its Binary implementation when Debug-formatted.
§

fn fmt_display(self) -> FmtDisplay<Self>where Self: Display,

Causes self to use its Display implementation when Debug-formatted.
§

fn fmt_lower_exp(self) -> FmtLowerExp<Self>where Self: LowerExp,

Causes self to use its LowerExp implementation when Debug-formatted.
§

fn fmt_lower_hex(self) -> FmtLowerHex<Self>where Self: LowerHex,

Causes self to use its LowerHex implementation when Debug-formatted.
§

fn fmt_octal(self) -> FmtOctal<Self>where Self: Octal,

Causes self to use its Octal implementation when Debug-formatted.
§

fn fmt_pointer(self) -> FmtPointer<Self>where Self: Pointer,

Causes self to use its Pointer implementation when Debug-formatted.
§

fn fmt_upper_exp(self) -> FmtUpperExp<Self>where Self: UpperExp,

Causes self to use its UpperExp implementation when Debug-formatted.
§

fn fmt_upper_hex(self) -> FmtUpperHex<Self>where Self: UpperHex,

Causes self to use its UpperHex implementation when Debug-formatted.
§

fn fmt_list(self) -> FmtList<Self>where &'a Self: for<'a> IntoIterator,

Formats each item in a sequence. Read more
source§

impl<T> From<T> for T

const: unstable · source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for Twhere U: From<T>,

const: unstable · source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

§

impl<T> Pipe for Twhere T: ?Sized,

§

fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> Rwhere Self: Sized,

Pipes by value. This is generally the method you want to use. Read more
§

fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> Rwhere R: 'a,

Borrows self and passes that borrow into the pipe function. Read more
§

fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> Rwhere R: 'a,

Mutably borrows self and passes that borrow into the pipe function. Read more
§

fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> Rwhere Self: Borrow<B>, B: 'a + ?Sized, R: 'a,

Borrows self, then passes self.borrow() into the pipe function. Read more
§

fn pipe_borrow_mut<'a, B, R>( &'a mut self, func: impl FnOnce(&'a mut B) -> R ) -> Rwhere Self: BorrowMut<B>, B: 'a + ?Sized, R: 'a,

Mutably borrows self, then passes self.borrow_mut() into the pipe function. Read more
§

fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> Rwhere Self: AsRef<U>, U: 'a + ?Sized, R: 'a,

Borrows self, then passes self.as_ref() into the pipe function.
§

fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> Rwhere Self: AsMut<U>, U: 'a + ?Sized, R: 'a,

Mutably borrows self, then passes self.as_mut() into the pipe function.
§

fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> Rwhere Self: Deref<Target = T>, T: 'a + ?Sized, R: 'a,

Borrows self, then passes self.deref() into the pipe function.
§

fn pipe_deref_mut<'a, T, R>(&'a mut self, func: impl FnOnce(&'a mut T) -> R) -> Rwhere Self: DerefMut<Target = T> + Deref, T: 'a + ?Sized, R: 'a,

Mutably borrows self, then passes self.deref_mut() into the pipe function.
source§

impl<T> Same<T> for T

§

type Output = T

Should always be Self
§

impl<T> Tap for T

§

fn tap(self, func: impl FnOnce(&Self)) -> Self

Immutable access to a value. Read more
§

fn tap_mut(self, func: impl FnOnce(&mut Self)) -> Self

Mutable access to a value. Read more
§

fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Selfwhere Self: Borrow<B>, B: ?Sized,

Immutable access to the Borrow<B> of a value. Read more
§

fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Selfwhere Self: BorrowMut<B>, B: ?Sized,

Mutable access to the BorrowMut<B> of a value. Read more
§

fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Selfwhere Self: AsRef<R>, R: ?Sized,

Immutable access to the AsRef<R> view of a value. Read more
§

fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Selfwhere Self: AsMut<R>, R: ?Sized,

Mutable access to the AsMut<R> view of a value. Read more
§

fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Selfwhere Self: Deref<Target = T>, T: ?Sized,

Immutable access to the Deref::Target of a value. Read more
§

fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Selfwhere Self: DerefMut<Target = T> + Deref, T: ?Sized,

Mutable access to the Deref::Target of a value. Read more
§

fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self

Calls .tap() only in debug builds, and is erased in release builds.
§

fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self

Calls .tap_mut() only in debug builds, and is erased in release builds.
§

fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Selfwhere Self: Borrow<B>, B: ?Sized,

Calls .tap_borrow() only in debug builds, and is erased in release builds.
§

fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Selfwhere Self: BorrowMut<B>, B: ?Sized,

Calls .tap_borrow_mut() only in debug builds, and is erased in release builds.
§

fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Selfwhere Self: AsRef<R>, R: ?Sized,

Calls .tap_ref() only in debug builds, and is erased in release builds.
§

fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Selfwhere Self: AsMut<R>, R: ?Sized,

Calls .tap_ref_mut() only in debug builds, and is erased in release builds.
§

fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Selfwhere Self: Deref<Target = T>, T: ?Sized,

Calls .tap_deref() only in debug builds, and is erased in release builds.
§

fn tap_deref_mut_dbg<T>(self, func: impl FnOnce(&mut T)) -> Selfwhere Self: DerefMut<Target = T> + Deref, T: ?Sized,

Calls .tap_deref_mut() only in debug builds, and is erased in release builds.
source§

impl<T> ToOwned for Twhere T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
§

impl<T> TryConv for T

§

fn try_conv<T>(self) -> Result<T, Self::Error>where Self: TryInto<T>,

Attempts to convert self into T using TryInto<T>. Read more
source§

impl<T, U> TryFrom<U> for Twhere U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
const: unstable · source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for Twhere U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
const: unstable · source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
§

impl<V, T> VZip<V> for Twhere V: MultiLane<T>,

§

fn vzip(self) -> V