ZCZ -- achieving \(n\)-bit SPRP security with a minimal number of tweakable-block-cipher calls
From MaRDI portal
Publication:1633460
DOI10.1007/978-3-030-03326-2_12zbMath1446.94103OpenAlexW2898391626MaRDI QIDQ1633460
Ritam Bhaumik, Mridul Nandi, Eik List
Publication date: 20 December 2018
Full work available at URL: https://doi.org/10.1007/978-3-030-03326-2_12
provable securityencryptiontweakable block ciphersymmetric-key cryptographyStrong Pseudo-random Permutations (SPRP)variable-input-length SPRP
Related Items (1)
Cites Work
- Generalized oblivious transfer by secret sharing
- Strong \((n, t, n)\) verifiable secret sharing scheme
- An explication of secret sharing schemes
- On the size of shares for secret sharing schemes
- Weighted threshold secret sharing schemes
- A \((t,n)\) multi-secret sharing scheme
- Realizing secret sharing with general access structure
- Threshold cryptography based on Asmuth-Bloom secret sharing
- Multilevel threshold secret sharing based on the Chinese remainder theorem
- A new \((t,n)\) multi-secret sharing scheme based on Shamir's secret sharing
- Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
- Chinese remaindering with errors
- Generalized Mignotte's Sequences Over Polynomial Rings
- Secret-Sharing Schemes: A Survey
- How to share a secret
- How to Share a Secret
- A modular approach to key safeguarding
- Alternative Protocols for Generalized Oblivious Transfer
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: ZCZ -- achieving \(n\)-bit SPRP security with a minimal number of tweakable-block-cipher calls
