The following pages link to (Q4250776):
Displayed 17 items.
- Selling multiple secrets to a single buyer (Q833739) (← links)
- Pipelined algorithms to detect cheating in long-term grid computations (Q959812) (← links)
- Private multiparty sampling and approximation of vector combinations (Q1014646) (← links)
- Protecting data privacy in private information retrieval schemes (Q1577014) (← links)
- Oblivious keyword search (Q1827575) (← links)
- More constructions of lossy and correlation-secure trapdoor functions (Q1946593) (← links)
- General constructions for information-theoretic private information retrieval (Q2485285) (← links)
- Improved Cryptanalysis of the Multi-Prime φ - Hiding Assumption (Q3011906) (← links)
- Public Key Locally Decodable Codes with Short Keys (Q3088130) (← links)
- General Construction of Chameleon All-But-One Trapdoor Functions (Q3092363) (← links)
- A Storage Efficient Redactable Signature in the Standard Model (Q3399214) (← links)
- Succinct NP Proofs from an Extractability Assumption (Q3507432) (← links)
- On the Validity of the Φ-Hiding Assumption in Cryptographic Protocols (Q3600384) (← links)
- Tighter Reductions for Forward-Secure Signature Schemes (Q4916016) (← links)
- Fast Private Norm Estimation and Heavy Hitters (Q5445506) (← links)
- A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval (Q5445520) (← links)
- Secure computation of the median (and other elements of specified ranks) (Q5962224) (← links)