Randomness recoverable secret sharing schemes
From MaRDI portal
Publication:6617634
DOI10.1007/S00145-024-09515-4MaRDI QIDQ6617634FDOQ6617634
Behzad Vahdani, Mohammad Hajiabadi, Shahram Khazaei
Publication date: 11 October 2024
Published in: Journal of Cryptology (Search for Journal in Brave)
lower boundssecret sharingone way functioninformation theoretic securityrandomness recoverable attribute based encryptionrandomness recovery
Information theory (general) (94A15) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- How to share a secret
- On cliques in graphs
- Title not available (Why is that?)
- Multiple assignment scheme for sharing secret
- On the size of shares for secret sharing schemes
- On secret sharing systems
- The size of a share must be large
- Secret-Sharing Schemes: A Survey
- Title not available (Why is that?)
- Signcryption from randomness recoverable public key encryption
- OAEP reconsidered
- Secret sharing and duality
- Key-dependent message security: generic amplification and completeness
- Network Information Theory
- A Mix-Net from Any CCA2 Secure Cryptosystem
- Progress in Cryptology - INDOCRYPT 2003
- Title not available (Why is that?)
- Advances in Cryptology - ASIACRYPT 2003
- Secret-sharing for NP
- Information Inequalities are Not Closed Under Polymatroid Duality
- New constructions of reusable designated-verifier NIZKs
- Realizing chosen ciphertext security generically in attribute-based encryption and predicate encryption
- Chosen ciphertext security from injective trapdoor functions
- On the Power of Amortization in Secret Sharing
- How to build a trapdoor function from an encryption scheme
- CCA security and trapdoor functions via key-dependent-message security
- Cryptographic primitives with hinting property
- Succinct computational secret sharing
This page was built for publication: Randomness recoverable secret sharing schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6617634)
