The following pages link to A note on negligible functions (Q1865127):
Displaying 6 items.
- Algebra of polynomially bounded sequences and negligible functions (Q271906) (← links)
- A mechanical approach to derive identity-based protocols from Diffie-Hellman-based protocols (Q507654) (← links)
- From non-adaptive to adaptive pseudorandom functions (Q2344050) (← links)
- Lower bounds for non-black-box zero knowledge (Q2490264) (← links)
- Secrecy Without Perfect Randomness: Cryptography with (Bounded) Weak Sources (Q2794527) (← links)
- Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error (Q6089979) (← links)
