نتایج جستجو برای: resilient cryptography
تعداد نتایج: 52839 فیلتر نتایج به سال:
This correspondence studies resilient functions which have applications in fault-tolerant distributed computing, quantum cryptographic key distribution, and random sequence generation for stream ciphers. We present a number of new methods for synthesizing resilient functions. An interesting aspect of these methods is that they are applicable both to linear and nonlinear resilient functions. Our...
Wireless sensor networks (WSNs) have been the subject of intensive research in past few years and backbone most maximum present information technology. WSNs employed various applications such as track monitoring battlegrounds military fields patients’ medical requirements civilian field. The wireless are always randomly distributed an open area (hostile), pervasive environment, media channel. T...
Due to the popularity of mobile communication, many computing devices are exposed remote environments without physical protection so that these easily suffer from leakage attacks (e.g., side-channel attacks). Under such attacks, when a device performs some cryptographic algorithm, an adversary may acquire partial bits secret keys participated in this algorithm. To resist researchers offer leaka...
Nowadays cloud is been widely used all over the world. Cloud computing creates a virtual space on Internet, which user can store data. Through you huge amount of data virtually, rather than storing it any physical system will acquire space. One question comes here , “How secure cloud?”, “Will be accessed by third-party?”. has given solution to these and problems providing “Cloud Cryptography” m...
In the previous works, to further provide continuous leakage resilience for identity-based encryption scheme, a new cryptography primitive, called updatable hash proof system (U-IB-HPS), was proposed. However, most of existing constructions have some deficiencies, they either do not perfect key update function or corresponding security with tight reduction relies on non-static complexity assump...
In leakage-resilient symmetric cryptography, two important concepts have been proposed in order to decrease the success rate of differential side-channel attacks. The first one is to limit the attacker’s data complexity by restricting the number of observable inputs; the second one is to create correlated algorithmic noise by using parallel S-boxes with equal inputs. The latter hinders the typi...
Certificateless public key cryptography (CL-PKC) is a useful method in order to solve the problems of traditional public key infrastructure (i.e., large amount of computation, storage and communication costs for managing certificates) and ID-based public key cryptography (i.e., key escrow problem), simultaneously. A signcryption scheme is an important primitive in cryptographic protocols which ...
Leakage-resilient cryptography aims to extend the rigorous guarantees achieved through the provable security paradigm to physical implementations. The constructions and mechanisms designed on basis of this new approach inevitably suffer from an Achilles heel: a bounded leakage assumption is needed. Currently, a huge gap exists between the theory of such designs and their implementation to confi...
This paper addresses the fundamental question of whether or not different, exciting primitives now being considered actually exist. We show that we, unfortunately, cannot have them all. We provide results of the form ¬A∨¬B, meaning one of the primitives A,B cannot exist. (But we don’t know which.) Specifically, we show that: (1) VGBO (Virtual Grey Box Obfuscation) for all circuits, which has be...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید