CryptoLover
  • Member for 7 years, 4 months
  • Last seen more than a month ago
1 answers
17 votes
2k views
16 bookmarks
Boolean Circuits vs Arithmetic Circuits
1 answers
6 votes
764 views
2 bookmarks
Black-Box Zero Knowledge vs Non-Black-Box Zero Knowledge
2 answers
5 votes
793 views
What's the definition of the width of a circuit
1 answers
4 votes
204 views
Offline Complexity of the garbling scheme
1 answers
4 votes
69 views
How to compute the output length of randomized encoding (or garbling)?
1 answers
3 votes
93 views
1 bookmarks
What does "constant rate" mean in universal composable commitment scheme?
0 answers
3 votes
62 views
Computational Randomized Encoding in the hybrid proof
2 answers
2 votes
115 views
Is there confirmation blocks in Proof-of-Stake Blockchain?
1 answers
2 votes
358 views
2 bookmarks
trapdoor commitment from lattice-based assumptions?
1 answers
2 votes
128 views
1 bookmarks
How many bits are needed to commit one bit non-interactively in the standard model?
0 answers
2 votes
222 views
1 bookmarks
What's the difference between non-interactive zero knowledge proof of knowledge and proof of membership?
1 answers
2 votes
85 views
The Encode algorithm of Garbling scheme is probabilistic or deterministic?
1 answers
1 votes
347 views
Question about second preimage resistance of hash function combiner
0 answers
1 votes
102 views
Decrypting partial message.
1 answers
1 votes
134 views
Is there any functional encryption scheme whose key generation circuit is in NC1?
0 answers
1 votes
30 views
Weakly Sublinear Compact FE from Succinct FE and XiO
1 answers
0 votes
6k views
What is the time complexity of computing a cryptographic hash function/random oracle?
1 answers
-2 votes
396 views
Question about the security of Substitution-Permutation Network