Pages that link to "Item:Q913490"
From MaRDI portal
The following pages link to A discrete logarithm implementation of perfect zero-knowledge blobs (Q913490):
Displaying 10 items.
- Which languages have 4-round zero-knowledge proofs? (Q421047) (← links)
- Constant-round perfect zero-knowledge computationally convincing protocols (Q808240) (← links)
- Tight bounds for the multiplicative complexity of symmetric functions (Q924152) (← links)
- Reducing complexity assumptions for statistically-hiding commitment (Q1027978) (← links)
- Minimum disclosure proofs of knowledge (Q1110348) (← links)
- Elliptic curve implementation of zero-knowledge blobs (Q1180510) (← links)
- On the communication complexity of zero-knowledge proofs (Q1261016) (← links)
- Realizing Hash-and-Sign Signatures under Standard Assumptions (Q3627443) (← links)
- Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments (Q5252662) (← links)
- Commitments with efficient zero-knowledge arguments from subset sum problems (Q6550619) (← links)
