On the power of amortization in secret sharing: \(d\)-uniform secret sharing and CDS with constant information rate
From MaRDI portal
Publication:1629415
DOI10.1007/978-3-030-03807-6_12zbMath1443.94087OpenAlexW2898897019MaRDI QIDQ1629415
Publication date: 11 December 2018
Full work available at URL: https://doi.org/10.1007/978-3-030-03807-6_12
Related Items (9)
On the power of amortization in secret sharing: \(d\)-uniform secret sharing and CDS with constant information rate ⋮ Measuring, simulating and exploiting the head concavity phenomenon in BKZ ⋮ Multi-party PSM, revisited: improved communication and unbalanced communication ⋮ Optimal linear multiparty conditional disclosure of secrets protocols ⋮ Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations ⋮ Unnamed Item ⋮ The communication complexity of private simultaneous messages, revisited ⋮ Placing conditional disclosure of secrets in the communication complexity universe ⋮ On abelian and homomorphic secret sharing schemes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Secret-sharing schemes for very dense graphs
- On the size of shares for secret sharing schemes
- The size of a share must be large
- Protecting data privacy in private information retrieval schemes
- On the power of amortization in secret sharing: \(d\)-uniform secret sharing and CDS with constant information rate
- Towards breaking the exponential barrier for general secret sharing
- The complexity of multiparty PSM protocols and related models
- Conditional disclosure of secrets: amplification, closure, amortization, lower-bounds, and separations
- Conditional disclosure of secrets via non-linear reconstruction
- Linear secret-sharing schemes for forbidden graph access structures
- Advances in cryptology -- CRYPTO 2017. 37th annual international cryptology conference, Santa Barbara, CA, USA, August 20--24, 2017. Proceedings. Part II
- Secret Sharing and Statistical Zero Knowledge
- A minimal model for secure computation (extended abstract)
- Secret-Sharing Schemes: A Survey
- How to share a secret
- Private information retrieval
- Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption
- Decomposition constructions for secret-sharing schemes
- On secret sharing systems
- Partial Garbling Schemes and Their Applications
- Breaking the circuit-size barrier in secret sharing
- Fuzzy Identity-Based Encryption
- On the Cryptographic Complexity of the Worst Functions
- Cryptography in $NC^0$
- The communication complexity of private simultaneous messages, revisited
This page was built for publication: On the power of amortization in secret sharing: \(d\)-uniform secret sharing and CDS with constant information rate
