A Probabilistic Error-Correcting Scheme that Provides Partial Secrecy

DOI10.1007/978-3-030-43662-9_1OpenAlexW3014562535MaRDI QIDQ5098765FDOQ5098765

Authors: Scott E. Decatur, Oded Goldreich, Dana Ron 

Publication date: 30 August 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-43662-9_1

Recommendations

• An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information
• Secure Erasure Codes With Partial Reconstructibility
• Secure Error-Correction Network Coding in a Randomized Setting
• Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures
• Estimation Theoretic Secure Communication via Encoder Randomization
• Secure Computation from Random Error Correcting Codes
• An efficient probabilistic encryption scheme
• Coding and Cryptography
• Error correcting codes, block designs, perfect secrecy and finite fields
• Conditionally-perfect secrecy and a provably-secure randomized cipher

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20)

Cites Work

• A Mathematical Theory of Communication
• Generalized privacy amplification
• Broadcast channels with confidential messages
• The Wire-Tap Channel
• Class of constructive asymptotically good algebraic codes
• Optimal rate code constructions for computationally simple channels
• Linking information reconciliation and privacy amplification
• Computational Sample Complexity

Cited In (2)

• Secure Erasure Codes With Partial Reconstructibility
• Beyond the Csiszár-Körner bound: best-possible wiretap coding via obfuscation

This page was built for publication: A Probabilistic Error-Correcting Scheme that Provides Partial Secrecy

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