The following pages link to Relativized cryptography (Q3689089):
Displaying 11 items.
- Unprovable security of perfect NIZK and non-interactive non-malleable commitments (Q332270) (← links)
- Cryptographic transformations of non-Shannon sources of information (Q466350) (← links)
- Probabilistic encryption (Q1057832) (← links)
- One-way functions and circuit complexity (Q1096587) (← links)
- New hash functions and their use in authentication and set equality (Q1152713) (← links)
- A time-luck tradeoff in relativized cryptography (Q1171879) (← links)
- On basing search SIVP on \(\mathbf{NP}\)-hardness (Q1629401) (← links)
- On the possibility of basing cryptography on \(\mathsf{EXP}\ne \mathsf{BPP} \) (Q2120065) (← links)
- A new password authentication mechanism based on two phases encryption (Q2780800) (← links)
- On Basing Private Information Retrieval on NP-Hardness (Q2796134) (← links)
- The Journey from NP to TFNP Hardness (Q4638115) (← links)
