The following pages link to (Q4318711):
Displayed 11 items.
- A note on universal composable zero-knowledge in the common reference string model (Q1007253) (← links)
- Practical proofs of knowledge without relying on theoretical proofs of membership on languages (Q1391315) (← links)
- A one-round, two-prover, zero-knowledge protocol for NP (Q1894702) (← links)
- Novel \(\Omega\)-protocols for NP (Q2480118) (← links)
- Proving possession of arbitrary secrets while not giving them away: New protocols and a proof in GNY logic (Q2500832) (← links)
- CCA2-Secure Threshold Broadcast Encryption with Shorter Ciphertexts (Q3503869) (← links)
- Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model (Q3519532) (← links)
- Efficient Protocols for Set Membership and Range Proofs (Q3600378) (← links)
- The Knowledge Complexity of Interactive Proof Systems (Q3833627) (← links)
- Construction of Universal Designated-Verifier Signatures and Identity-Based Signatures from Standard Signatures (Q5445450) (← links)
- Isolated Proofs of Knowledge and Isolated Zero Knowledge (Q5458611) (← links)