Sharing many secrets with computational provable security

DOI10.1016/J.IPL.2013.05.003MaRDI QIDQ2444772zbMATH OpenOpenAlexFDO

Authors Javier Herranz, Alexandre Ruiz, Germán Sáez

Publication date 11 April 2014

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2013.05.003

zbMATH Keywords

cryptographymulti secret sharing schemesprovable securitysymmetric encryption

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• New results and applications for multi-secret sharing schemes
• Sharing one secret vs. sharing many secrets.
• Sharing multiple secrets: Models, schemes and analysis
• scientific article; zbMATH DE number 1024051
• scientific article; zbMATH DE number 512874

Cites work

• A scheme for threshold multi-secret sharing
• Anonymity in shared symmetric key primitives
• Characterization of security notions for probabilistic private-key encryption
• Distributing the encryption and decryption of a block cipher
• Dynamic multi-secret sharing scheme
• How to share a secret
• scientific article; zbMATH DE number 5009203 (Why is no real title available?)
• scientific article; zbMATH DE number 4123667 (Why is no real title available?)
• scientific article; zbMATH DE number 1024051 (Why is no real title available?)
• scientific article; zbMATH DE number 1406777 (Why is no real title available?)
• On-line secret sharing
• Sharing multiple secrets: Models, schemes and analysis

Cited in

(2)

• New multi-stage secret sharing in the standard model
• Computationally secure robust multi-secret sharing for general access structure

This page was built for publication: Sharing many secrets with computational provable security

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2444772)