Filters








8,066 Hits in 8.2 sec

Inception Makes Non-malleable Codes Stronger [chapter]

Divesh Aggarwal, Tomasz Kazana, Maciej Obremski
2017 Lecture Notes in Computer Science  
A large body of the recent work has focused on various constructions of non-malleable codes in the split-state model.  ...  In this paper we give the first efficient, information-theoretic secure construction of continuous nonmalleable codes in the split-state model.  ...  If (Enc, Dec) is an ε-super strong non-malleable code in the split-state model then (Enc, Dec) is a (T, (T + 1)ε)−continuous [1, 1] non-malleable code in the split-state model.  ... 
doi:10.1007/978-3-319-70503-3_10 fatcat:fpj5iwlwpzd6dmocwfenfh5a7y

Continuously Non-Malleable Codes in the Split-State Model from Minimal Assumptions [chapter]

Rafail Ostrovsky, Giuseppe Persiano, Daniele Venturi, Ivan Visconti
2018 Lecture Notes in Computer Science  
In this work, we focus on so-called continuously non-malleable codes in the split-state model, as proposed by Faust et al.  ...  Achieving continuous non-malleability in the split-state model has been so far very hard.  ...  Conclusion and Open Problems We have shown a construction of a split-state continuously non-malleable code in the plain model.  ... 
doi:10.1007/978-3-319-96878-0_21 fatcat:jmh5v6huljaunbllred4ptruzm

Non-Malleable Code in the Split-State Model

Divesh Aggarwal, Marshall Ball, Maciej Obremski
2022 Entropy  
We survey various constructions and applications of non-malleable codes in the split-state model.  ...  Over the last decade, non-malleable codes have been studied for a wide variety of tampering families.  ...  Conflicts of Interest: The authors declare no conflict of interest.  ... 
doi:10.3390/e24081038 fatcat:5lldsoxzkjaullocu7z4qgklcu

FMNV continuous non-malleable encoding scheme is more efficient than believed

Amir S. Mortazavi, Mahmoud Salmasizadeh, Amir Daneshgar
2016 2016 13th International Iranian Society of Cryptology Conference on Information Security and Cryptology (ISCISC)  
The first continuous non-malleable encoding scheme has been proposed by Faust et el. (FMNV) in 2014. In this paper, we propose a new method for proving continuous non-malleability of FMNV scheme.  ...  Nonmalleable codes are used in tamper resilient cryptography and protecting memory against tampering attacks. Several kinds of definitions for the non-malleability exist in the literature.  ...  The split-state model is the class of tampering Turing machines for which efficient constructions of non-malleable codes are known.  ... 
doi:10.1109/iscisc.2016.7736454 dblp:conf/iscisc/MortazaviSD16 fatcat:eow5rbilbbc2ha42bvjpe6sjli

Continuously Non-malleable Codes in the Split-State Model

Sebastian Faust, Pratyay Mukherjee, Jesper Buus Nielsen, Daniele Venturi
2020 Journal of Cryptology  
. • We show that continuous non-malleability in the split-state model is impossible without relying on computational assumptions. • We construct a computationally secure split-state code satisfying continuous  ...  non-malleability in the common reference string (CRS) model.  ...  The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material.  ... 
doi:10.1007/s00145-020-09362-z fatcat:a6yuuu43zvec7crceiwfsd5thq

Information-Theoretic Local Non-malleable Codes and Their Applications [chapter]

Nishanth Chandran, Bhavana Kanukurthi, Srinivasan Raghuraman
2015 Lecture Notes in Computer Science  
This is one of the strongest adversarial models for which explicit constructions of standard non-malleable codes (without locality) are known.  ...  Unfortunately, their construction is secure only in the computational setting. In this work, we construct information-theoretic non-malleable codes which are locally updatable and decodable.  ...  In particular, we have existing constructions of non-malleable codes in the split-state model which we could use as a building block, except that it is unclear how to use them.  ... 
doi:10.1007/978-3-662-49099-0_14 fatcat:uho3xnepdvf6nmhwinm7fzeyti

Inception makes non-malleable codes shorter as well! [article]

Divesh Aggarwal, Maciej Obremski
2019 IACR Cryptology ePrint Archive  
In this work, we give a constant rate non-malleable reduction from the family G to NM, thereby giving the first constant rate non-malleable code in the split-state model.  ...  The family which received the most attention is the family of tampering functions in the so called (2-part) split-state model: here the message x is encoded into two shares L and R, and the attacker is  ...  There have been some results that have obtained non-malleable codes against continuous tampering in the split-state model [AKO17, ADN + 17].  ... 
dblp:journals/iacr/AggarwalO19 fatcat:zftlglwlergy3g4sd2atunikvq

Locally Decodable and Updatable Non-malleable Codes and Their Applications [chapter]

Dana Dachman-Soled, Feng-Hao Liu, Elaine Shi, Hong-Sheng Zhou
2015 Lecture Notes in Computer Science  
In this work, we propose combining the concepts of non-malleability, leakage resilience, and locality in a coding scheme. The contribution of this work is three-fold: 1.  ...  Non-malleable codes, introduced as a relaxation of error-correcting codes by Dziembowski, Pietrzak and Wichs (ICS '10), provide the security guarantee that the message contained in a tampered codeword  ...  With regard to techniques, they use a stronger version of non-malleable codes in the split-state setting (called continual non-malleable codes [24] ) for their construction.  ... 
doi:10.1007/978-3-662-46494-6_18 fatcat:d23kqatksfaxbfgvbp4btisc5i

Rate one-third non-malleable codes

Divesh Aggarwal, Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Maciej Obremski, Sruthi Sekar
2022 Symposium on the Theory of Computing  
Following a long line of work, Aggarwal and Obremski (FOCS 2020) showed the first constant rate non-malleable code in the 2−split state model; however, this constant was a minuscule 10 −6 !  ...  In this work, we build a Non-malleable Code with rate 1/3. This nearly matches the rate 1/2 lower bound for this model due to Cheraghchi and Guruswami (ITCS 2014).  ...  The authors would also like to thank the anonymous referees for their valuable comments and helpful suggestions. The third author's work is supported by Microsoft Research Grant.  ... 
doi:10.1145/3519935.3519972 dblp:conf/stoc/AggarwalKOOS22 fatcat:2mnjyu7ywrfjtmrqwxmxsedtte

Continuous Non-malleable Codes [chapter]

Sebastian Faust, Pratyay Mukherjee, Jesper Buus Nielsen, Daniele Venturi
2014 Lecture Notes in Computer Science  
We construct a split-state code satisfying continuous non-malleability.  ...  We show how to construct continuous non-malleable codes in the common split-state model where an encoding consist of two parts and the tampering can be arbitrary but has to be independent with both parts  ...  Part of this work was done while this author was at the University of Warsaw and was supported by the WELCOME/2010-4/2 grant founded within the framework of the EU Innovative Economy Operational Programme  ... 
doi:10.1007/978-3-642-54242-8_20 fatcat:uzb4ugftojclfk2fes2xcfooge

Non-malleable codes from additive combinatorics

Divesh Aggarwal, Yevgeniy Dodis, Shachar Lovett
2014 Proceedings of the 46th Annual ACM Symposium on Theory of Computing - STOC '14  
As our main result, we build the first efficient, multi-bit, information-theoretically-secure non-malleable code in the split-state model.  ...  The split-state tampering arises in many realistic applications, such as the design of non-malleable secret sharing schemes, motivating the question of designing efficient non-malleable codes in this model  ...  We would also like to thank Stefan Dziembowski, Tomasz Kazana, and Maciej Obremski for sharing their recent work on non-malleable codes for 1-bit messages [DKO13] .  ... 
doi:10.1145/2591796.2591804 dblp:conf/stoc/AggarwalDL14 fatcat:n5nocrpjqfg77i5ujwxagr45qm

Non-malleable Reductions and Applications

Divesh Aggarwal, Yevgeniy Dodis, Tomasz Kazana, Maciej Obremski
2015 Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing - STOC '15  
Despite this attention, the following problem remained open: Build efficient, information-theoretically secure non-malleable codes in the split-state model with constant encoding rate: |L| = |R| = O(|x  ...  various (independently interesting) tampering families F to each other; (d) construct several new non-malleable codes in the split-state model by applying the composition theorem to a series of easy to  ...  non-malleable code in the 9-split-state model (i.e., number of parts t = 9).  ... 
doi:10.1145/2746539.2746544 dblp:conf/stoc/AggarwalDKO15 fatcat:bubvujeuz5endhk6ykhwqurdaq

Non-Malleable Codes from Additive Combinatorics

Divesh Aggarwal, Yevgeniy Dodis, Shachar Lovett
2018 SIAM journal on computing (Print)  
As our main result, we build the first efficient, multi-bit, information-theoretically-secure non-malleable code in the split-state model.  ...  The split-state tampering arises in many realistic applications, such as the design of non-malleable secret sharing schemes, motivating the question of designing efficient non-malleable codes in this model  ...  We would also like to thank Stefan Dziembowski, Tomasz Kazana, and Maciej Obremski for sharing their recent work on non-malleable codes for 1-bit messages [DKO13] .  ... 
doi:10.1137/140985251 fatcat:5gtvoadv35a67pnto56r4jmkky

Quantum secure non-malleable codes in the split-state model [article]

Divesh Aggarwal and Naresh Goud Boddu and Rahul Jain
2022 arXiv   pre-print
We construct explicit quantum secure non-malleable-codes in the split-state model.  ...  We consider the security of non-malleable-codes in the split-state model when the adversary is allowed to make use of arbitrary entanglement to tamper the parts X and Y.  ...  We construct quantum secure one-many non-malleable code with efficient encoding and decoding procedures for t = n Ω(1) , message length m = n Ω(1) , error ε = 2 −n Ω(1) and codeword of size 2n.  ... 
arXiv:2202.13354v2 fatcat:r67lqi2hv5g3fapeoi5mbknwyy

Leakage-Resilient Non-malleable Codes [chapter]

Divesh Aggarwal, Stefan Dziembowski, Tomasz Kazana, Maciej Obremski
2015 Lecture Notes in Computer Science  
In this paper we close this gap by showing a non-malleable code in the 2-split state model that is secure against leaking almost a 1/12-th fraction of the bits from the codeword (in the bounded-leakage  ...  This is achieved via a generic transformation that takes as input any non-malleable code (Enc, Dec) in the 2-split state model, and constructs out of it another nonmalleable code (Enc , Dec ) in the 2-  ...  This holds for any non-malleable code in the 2-split-state model.  ... 
doi:10.1007/978-3-662-46494-6_17 fatcat:aj5zqkq5z5dtzed655ithurgie
« Previous Showing results 1 — 15 out of 8,066 results