نتایج جستجو برای: Tamper-resilient Cryptography

تعداد نتایج: 54844  

Journal: :isecure, the isc international journal of information security 0
a. mortazavi sharif university of technology m. salmasizadeh sharif university of technology a. daneshgar sharif university of technology

a non-malleable code is a variant of an encoding scheme which is resilient to tampering attacks. the main idea behind nonmalleable coding is that the adversary should not be able to obtain any valuable information about the message. non-malleablecodes are used in tamper-resilient cryptography and protecting memories against tampering attacks. many different types of nonmalleability have already...

A non-malleable code is a variant of an encoding scheme which is resilient to tampering attacks. The main idea behind non-malleable coding is that the adversary should not be able to obtain any valuable information about the message. Non-malleable codes are used in tamper-resilient cryptography and protecting memories against tampering attacks. Many different types of non-malleability have alre...

Journal: :IACR Cryptology ePrint Archive 2013
Ivan Damg̊ard Sebastian Faust Pratyay Mukherjee Daniele Venturi

We initiate a general study of schemes resilient to both tampering and leakage attacks. Tampering attacks are powerful cryptanalytic attacks where an adversary can change the secret state and observes the effect of such changes at the output. Our contributions are outlined below: 1. We propose a general construction showing that any cryptographic primitive where the secret key can be chosen as ...

Journal: :IACR Cryptology ePrint Archive 2013
Aggelos Kiayias Yiannis Tselekounis

We initiate the investigation of gate-tampering attacks against cryptographic circuits. Our model is motivated by the plausibility of tampering directly with circuit gates and by the increasing use of tamper resilient gates among the known constructions that are shown to be resilient against wiretampering adversaries. We prove that gate-tampering is strictly stronger than wire-tampering. On the...

2010
Feng-Hao Liu Anna Lysyanskaya

Gennaro et al. initiated the study of algorithmic tamper proof (ATP) cryptography: cryptographic hardware that remains secure even in the presence of an adversary who can tamper with the memory content of a hardware device. In this paper, we solve an open problem stated in their paper, and also consider whether a device can be secured against an adversary who can both tamper with its memory and...

2014
Sebastian Faust Pratyay Mukherjee Jesper Buus Nielsen Daniele Venturi

Non-malleable codes are a natural relaxation of error correcting/detecting codes that have useful applications in the context of tamper resilient cryptography. Informally, a code is non-malleable if an adversary trying to tamper with an encoding of a given message can only leave it unchanged or modify it to the encoding of a completely unrelated value. This paper introduces an extension of the ...

Journal: :IACR Cryptology ePrint Archive 2013
Per Austrin Kai-Min Chung Mohammad Mahmoody Rafael Pass Karn Seth

We initiate a study of the security of cryptographic primitives in the presence of efficient tampering attacks to the randomness of honest parties. More precisely, we consider p-tampering attackers that may tamper with each bit of the honest parties’ random tape with probability p, but have to do so in an “online” fashion. We present both positive and negative results: • Negative Results: Any s...

Journal: :IACR Cryptology ePrint Archive 2016
Amir S. Mortazavi Mahmoud Salmasizadeh Amir Daneshgar

A non-malleable encoding scheme is a keyless encoding scheme which is resilient to tampering attacks. Such a scheme is said to be continuously secure if the scheme is resilient to attacks containing more than one tampering procedure. Also, such a scheme is said to have tamper-detection property if any kind of tampering attack is detected. In [S. Faust, et al., Continuous nonmalleable codes, TCC...

2012
Feng-Hao Liu

My research interests center around the area of error-tolerant cryptography. In cryptography, our goal is to design protocols that withstand malicious behavior of an adversary. Traditionally, the focus was on a setting where honest users followed their protocol exactly, without fault. But what if an adversary can induce faults, for example a physical attack that changes the state of a user’s co...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید