Pages that link to "Item:Q5716759"
From MaRDI portal
The following pages link to Automata, Languages and Programming (Q5716759):
Displaying 8 items.
- Round optimal black-box ``commit-and-prove'' (Q1629413) (← links)
- Bounds on the efficiency of black-box commitment schemes (Q2268099) (← links)
- Round-Optimal Black-Box Statistically Binding Selective-Opening Secure Commitments (Q2900636) (← links)
- Lower bounds on the efficiency of encryption and digital signature schemes (Q3581302) (← links)
- Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments (Q5252662) (← links)
- A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval (Q5445520) (← links)
- Black-Box Constructions for Fully-Simulatable Oblivious Transfer Protocols (Q5502762) (← links)
- Black-box anonymous commit-and-prove (Q6134847) (← links)