• No results found

cryptographic primitives

Cryptographic Primitives and Design Frameworks of Physical Layer Encryption for Wireless Communications

Cryptographic Primitives and Design Frameworks of Physical Layer Encryption for Wireless Communications

... ABSTRACT Security is always an important issue in wireless communications. Physical layer encryp- tion (PLE) is an effective way to enhance wireless communication security and prevent eavesdropping. Rather than replacing ...

14

Combining Cryptographic Primitives to Avert Overcrowding Attacks in Wireless Networks

Combining Cryptographic Primitives to Avert Overcrowding Attacks in Wireless Networks

... combining cryptographic primitives with physical-layer ...(SHCS), Cryptographic Puzzles Hiding Schemes (CPHS), All-Or-Nothing Transformation Hiding Schemes ...

6

A comment on information leakage from robust code-based checkers detecting fault attacks on cryptographic primitives

A comment on information leakage from robust code-based checkers detecting fault attacks on cryptographic primitives

... Cryptographic hardware primitives must be protected against fault-injection attacks. Security-oriented error-detecting codes provide (probabilistic) guarantees for detection of maliciously injected faults ...

15

Combining Cryptographic Primitives to
Prevent Jamming Attacks in Wireless
Networks

Combining Cryptographic Primitives to Prevent Jamming Attacks in Wireless Networks

... combining cryptographic primitives with physical-layer ...(SHCS), Cryptographic Puzzles Hiding Schemes (CPHS), All-Or-Nothing Transformation Hiding Schemes ...

5

A  Method  For  Generation  Of  High-Nonlinear  S-Boxes  Based  On  Gradient  Descent

A Method For Generation Of High-Nonlinear S-Boxes Based On Gradient Descent

... Criteria based on the analysis of the properties of vectorial Boolean functions for selection of substitutions (S-boxes) for symmetric cryptographic primitives are given. We propose an improved gradient ...

9

On  Constrained  Implementation  of  Lattice-based  Cryptographic  Primitives   and  Schemes  on  Smart  Cards

On Constrained Implementation of Lattice-based Cryptographic Primitives and Schemes on Smart Cards

... lattice-based cryptographic scheme is implemented on a smart card, and its efficiency and practicality is ...lattice-based cryptographic primitives, we have implemented fast Fourier transform (FFT) ...

26

Dronecrypt -  An  Efficient  Cryptographic  Framework  for  Small  Aerial  Drones

Dronecrypt - An Efficient Cryptographic Framework for Small Aerial Drones

... Limitations: The main limitation of our proposed framework is the increased private key size, that is inherited from the BPV precomputation technique. More specifically, our improved PKI primitives require the ...

13

On  the  Bit  Security  of  Cryptographic  Primitives

On the Bit Security of Cryptographic Primitives

... of cryptographic games (capturing both decision and search problems), aimed at capturing the intuition that a cryptographic primitive with k-bit security is as hard to break as an ideal cryptographic ...

20

On  Hardening  Leakage  Resilience  of  Random  Extractors  for  Instantiations  of  Leakage  Resilient  Cryptographic  Primitives

On Hardening Leakage Resilience of Random Extractors for Instantiations of Leakage Resilient Cryptographic Primitives

... graphic primitives even provably secure under traditional black-box model, especially when they are being instantiated on computing ...achieving cryptographic security on devices that leaks information ...

23

Decentralized  Anonymous  Credentials

Decentralized Anonymous Credentials

... standard cryptographic primitives, we propose and provide a proof of security for a basic anonymous credential system that allows users to make flexible identity assertions with strong privacy ...

21

Secure  two-party  computation  in  applied  pi-calculus:  models   and  verification

Secure two-party computation in applied pi-calculus: models and verification

... Dahl and Damgård [13] also propose a formal framework for specifying two-party compu- tation protocols and present the automated verification with ProVerif of an oblivious transfer protocol based on homomorphic ...

18

Memory  Lower  Bounds  of  Reductions  Revisited

Memory Lower Bounds of Reductions Revisited

... Abstract. In Crypto 2017, Auerbach et al. initiated the study on memory-tight reductions and proved two negative results on the memory- tightness of restricted black-box reductions from multi-challenge security to ...

30

Type-Based  Verification  of  Electronic  Voting  Protocols

Type-Based Verification of Electronic Voting Protocols

... Cryptographic protocols are notoriously difficult to design and their manual security analysis is extremely complicated and error-prone. As a matter of fact, security vulner- abilities have accompanied early ...

22

Four  Neighbourhood  Cellular  Automata  as  Better  Cryptographic  Primitives

Four Neighbourhood Cellular Automata as Better Cryptographic Primitives

... Cellular Automata (CA) are characterised by speed in computation and can be modelled to offer high diffusion and randomness. Thus, CA can effectively be used as good cryptographic primitives. The simple and ...

9

Packet Classification for Preventing Selective Jamming Attacks

Packet Classification for Preventing Selective Jamming Attacks

... Abstract — The open nature of wireless medium in wireless network leaves it vulnerable to multiple security threats. In this project we investigate the feasibility of real-time packet classification for launching ...

12

A  Measure  of  Dependence  for  Cryptographic  Primitives  Relative  to  Ideal  Functions

A Measure of Dependence for Cryptographic Primitives Relative to Ideal Functions

... ideal primitives into the more realistic setting of protocol assurance with fixed ...on cryptographic primitives provide a direct means of determining the practical resistance or vulnerability of ...

18

Revisiting  Cryptographic  Accumulators,  Additional  Properties   and  Relations  to  other  Primitives

Revisiting Cryptographic Accumulators, Additional Properties and Relations to other Primitives

... (randomized) cryptographic accumulators which covers static and dynamic accumulators, their universal fea- tures and includes the notions of undeniability and ...

28

Unsupervised Learning of Semantic Relation Composition

Unsupervised Learning of Semantic Relation Composition

... compose primitives is used to detect prohibited combinations of relations based on semantic grounds and identify the conclusion of composing ...Without primitives, the cells in Ta- ble 5 would be either ...

10

Related-Key  Almost  Universal  Hash  Functions:  Definitions,  Constructions   and  Applications

Related-Key Almost Universal Hash Functions: Definitions, Constructions and Applications

... A direct application of UHFs is in message authentication codes (MACs) in which the message is hashed by the UHF into a short digest and then en- crypted into a tag. MACs of this kind have been standardized in ISO/IEC ...

19

ZKPDL:  A  Language-Based  System  for  Efficient  Zero-Knowledge  Proofs   and  Electronic  Cash

ZKPDL: A Language-Based System for Efficient Zero-Knowledge Proofs and Electronic Cash

... recent cryptographic research which has applications for privacy-preserving systems is zero-knowledge proofs [47, 46, 17, 39], which provide a way of proving that a statement is true without re- vealing anything ...

16

Show all 838 documents...

Related subjects