A Rate-Optimizing Compiler for Non-malleable Codes Against Bit-Wise Tampering and Permutations
- 1 January 2015
- book chapter
- Published by Springer Nature
- p. 375-397
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Non-malleable codes from additive combinatorics2014
- Capacity of non-malleable codes2014
- Locally Updatable and Locally Decodable Codes2014
- Non-malleable Coding against Bit-Wise and Split-State Tampering2014
- BiTR: Built-in Tamper ResilienceLecture Notes in Computer Science, 2011
- Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors2008
- Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields2006
- Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext AttackSIAM Journal on Computing, 2003
- Security of Ramp Schemes2000
- The tail of the hypergeometric distributionDiscrete Mathematics, 1979