User Alin Tomescu

7 votes

Proving set membership in less than $\log{N}$ bandwidth

answered Sep 2, 2015 at 0:24

6 votes

Proof of non-membership on a Merkle tree?

answered Jan 15, 2016 at 16:14

5 votes

Deletion in RSA Accumulator

answered Jan 31, 2018 at 1:11

5 votes

Bilinear pairing arithmetic - cryptographic accumulators

answered Jan 31, 2018 at 16:13

4 votes

Accepted

Composite order ECC and Ristretto

answered Jul 20, 2022 at 16:31

2 votes

What's the difference among Vector Commitment, Zero-knowledge Set, Zero-knowledge Accumulator, and Zero-knowledge Elementary Database?

answered Jan 23, 2023 at 1:27

2 votes

Dynamically building a Merkle tree for unkown size

answered Jan 23, 2023 at 1:53

2 votes

Rsa accumulator storage size

answered Jan 23, 2023 at 4:47

2 votes

Accepted

Accumulators with batch additions

answered Feb 1, 2018 at 12:11

2 votes

Is it possible to build short proofs of arbitrary computations over a big list?

answered Feb 3, 2018 at 2:03

2 votes

Discrete log accumulator without pairings?

answered Nov 26, 2017 at 0:35

2 votes

Proof of membership on a merkle tree

answered Jan 23, 2023 at 5:53

2 votes

How to prove that a line belongs to a final hash without knowing/re-hashing all other lines?

answered Jan 23, 2023 at 6:08

1 vote

Accepted

Non-pruned accumulators with asymptotic worst space $O(\log_2 n)$, or cheaper?

answered Feb 5, 2023 at 1:27

1 vote

Deletion complexity in a RSA accumulator

answered Feb 5, 2023 at 2:44

1 vote

Type of values that can be accumulated in bilinear map (multiplicative) accumulator reg

answered Jan 31, 2018 at 15:33

1 vote

Transparent, publicly updatable accumulator with constant-sized witnesses

answered Jan 31, 2018 at 1:27

1 vote

What is stopping someone from saving encrypted info, and decoding it later?

answered Sep 1, 2015 at 23:56

1 vote

Accepted

q-Strong Bilinear Diffie-Hellman

answered Oct 17, 2017 at 19:12

1 vote

What is the canonical way of creating Merkle tree branches?

answered Feb 3, 2018 at 14:26

1 vote

Accepted

Black-box secret sharing schemes

answered Jun 17, 2022 at 17:05

1 vote

Accepted

Security of seed from a dictionary

answered Feb 2, 2018 at 22:34

1 vote

Cryptographic accumulators and proof of immutability

answered Jan 23, 2023 at 5:10

0 votes

Possible to use an accumulator to "license" or restrict the qty of certificates being used?

answered Jan 31, 2018 at 11:53

-1 votes

Is it safe to use XOR to encrypt data key using master key

answered Jan 15, 2016 at 16:34

Stack Exchange Network

25 Answers

Proving set membership in less than $\log{N}$ bandwidth

Proof of non-membership on a Merkle tree?

Deletion in RSA Accumulator

Bilinear pairing arithmetic - cryptographic accumulators

Composite order ECC and Ristretto

What's the difference among Vector Commitment, Zero-knowledge Set, Zero-knowledge Accumulator, and Zero-knowledge Elementary Database?

Dynamically building a Merkle tree for unkown size

Rsa accumulator storage size

Accumulators with batch additions

Is it possible to build short proofs of arbitrary computations over a big list?

Discrete log accumulator without pairings?

Proof of membership on a merkle tree

How to prove that a line belongs to a final hash without knowing/re-hashing all other lines?

Non-pruned accumulators with asymptotic worst space $O(\log_2 n)$, or cheaper?

Deletion complexity in a RSA accumulator

Type of values that can be accumulated in bilinear map (multiplicative) accumulator reg

Transparent, publicly updatable accumulator with constant-sized witnesses

What is stopping someone from saving encrypted info, and decoding it later?

q-Strong Bilinear Diffie-Hellman

What is the canonical way of creating Merkle tree branches?

Black-box secret sharing schemes

Security of seed from a dictionary

Cryptographic accumulators and proof of immutability

Possible to use an accumulator to "license" or restrict the qty of certificates being used?

Is it safe to use XOR to encrypt data key using master key