Cheating-tolerant and threshold-based secure information exchange among propinquity of adversaries

DOI10.1007/978-981-16-1295-4_11MaRDI QIDQ5050226zbMATH OpenOpenAlexFDO

Authors Anindya Biswas, Mou Dasgupta

Publication date 15 November 2022

Published in Algorithms for Intelligent Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-981-16-1295-4_11

zbMATH Keywords

cheating detectionLagrange polynomial interpolationcryptographic hash functionKGCcheating identificationsecret-key management

Mathematics Subject Classification ID

Information theory (general) (94A15) Cryptography (94A60)

Recommendations

• The Detection of Cheaters in Thershold Schemes
• Efficient (k,n) Threshold Secret Sharing Schemes Secure Against Cheating from n − 1 Cheaters
• Properties and constraints of cheating-immune secret sharing schemes
• Optimum Secret Sharing Scheme Secure against Cheating
• Almost Optimum Secret Sharing Schemes Secure Against Cheating for Arbitrary Secret Distribution

Cites work

• Certificateless identity-concealed authenticated encryption under multi-KGC
• Detection and identification of cheaters in \((t,n)\) secret sharing scheme
• Hierarchical threshold secret sharing
• How to share a secret
• How to share a secret with cheaters
• Identity-Based Encryption from the Weil Pairing
• New directions in cryptography

This page was built for publication: Cheating-tolerant and threshold-based secure information exchange among propinquity of adversaries

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