Cryptography with weak privacy
From MaRDI portal
Cites work
- 2-server PIR with sub-polynomial communication
- A minimal model for secure computation (extended abstract)
- A Zero-One Law for Boolean Privacy
- Better secret sharing via robust conditional disclosure of secrets
- Bounds on the Threshold Gap in Secret Sharing and its Applications
- Breaking the circuit-size barrier in secret sharing
- Communication Theory of Secrecy Systems*
- Conditional disclosure of secrets via non-linear reconstruction
- Covering a graph by complete bipartite graphs
- Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation
- How to Garble Arithmetic Circuits
- How to share a secret
- scientific article; zbMATH DE number 1024051 (Why is no real title available?)
- scientific article; zbMATH DE number 1024063 (Why is no real title available?)
- scientific article; zbMATH DE number 1088899 (Why is no real title available?)
- scientific article; zbMATH DE number 7650434 (Why is no real title available?)
- Indistinguishability Amplification
- Multi-party PSM, revisited: improved communication and unbalanced communication
- Multiple assignment scheme for sharing secret
- On cryptography with auxiliary input
- On the Cryptographic Complexity of the Worst Functions
- Privacy and Communication Complexity
- Private information retrieval
- Secure Computation from Random Error Correcting Codes
- Security of Ramp Schemes
- Succinct computational secret sharing
- The complexity of multiparty PSM protocols and related models
- The mathematics of Paul Erdős II
- Theory of Cryptography
- Theory of Cryptography
- Towards breaking the exponential barrier for general secret sharing
- Upslices, downslices, and secret-sharing with complexity of 1.5ⁿ
- Weakly-Private Secret Sharing Schemes
This page was built for publication: Cryptography with weak privacy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7233241)
