Lightweight Crypto Stack for TPMS Using Lesamnta-LW

An AES Based 256-bit Hash Function for Lightweight Applications: Lesamnta-LW

This paper proposes a new lightweight 256-bit hash function Lesamnta-LW. The security of Lesamnta-LW is reduced to that of the underlying AES-based block cipher and it is theoretically analyzed for an important application, namely the key-prefix mode. While most of recently proposed lightweight primitives are hardware-oriented with very small footprints, our main target with Lesamnta-LW is to a...

An Ultra-Lightweight Side-Channel Resistant Crypto for Pervasive Devices

Lightweight cryptography is equipped as security component, to secure those pervasive devices that are security and privacy sensitive. It has been conclusively proven that unprotected cryptographic implementations are vulnerable to side-channel attacks. In practice, area resource smaller than 3,000GE (5,000GE sometimes) may be available for security components in pervasive devices. This paper p...

Lightweight Zero-Knowledge Proofs for Crypto-Computing Protocols

Crypto-computing is a set of well-known techniques for computing with encrypted data. The security of the corresponding protocols are usually proven in the semi-honest model. In this work, we propose a new class of zeroknowledge proofs, which are tailored for crypto-computing protocols. First, these proofs directly employ properties of the underlying crypto systems and thus many facts have more...

Lightweight Lexical Closures for Legitimate Execution Stack Access

We propose a new language concept called “L-closures” for a running program to legitimately inspect/modify the contents of its execution stack. L-closures are lightweight lexical closures created by evaluating nested function definitions. A lexical closure can access the lexicallyscoped variables in the creation-time environment and indirect calls to it provide legitimate stack access. By using...

Lw Me