Towards a Full-Featured Implementation of Attribute Based Credentials on...
Attribute-based Credentials (ABCs) allow citizens to prove certain properties about themselves without necessarily revealing their full identity. Smart cards are an attractive container for such...
View ArticleEfficient and Secure Algorithms for GLV-Based Scalar Multiplication and their...
We propose efficient algorithms and formulas that improve the performance of side-channel protected elliptic curve computations with special focus on scalar multiplication exploiting the...
View ArticleCMCC: Misuse Resistant Authenticated Encryption with Minimal Ciphertext...
In some wireless environments, minimizing the size of messages is paramount due to the resulting significant energy savings. We present CCS which is a new family of tweakable enciphering schemes (TES)....
View ArticleEfficient Quantum-Immune Keyless Signatures with Identity, by Ahto Buldas and...
We show how to extend hash-tree based data signatures to server-assisted personal digital signature schemes. The new signature scheme does not use trapdoor functions and is based solely on...
View ArticleFOAM: Searching for Hardware-Optimal SPN Structures and Components with a...
In this article, we propose a new comparison metric, the figure of adversarial merit (FOAM), which combines the inherent security provided by cryptographic structures and components with their...
View ArticleBits Security of the CDH Problems over Finite Fields, by Mingqiang Wang and...
It is a long-standing open problem to prove the existence of (deterministic) hard-core predicates for the Diffie-Hellman problem over finite fields, without resorting to the generic approaches for any...
View ArticleThe Adjacency Graph of Some LFSRs, by Ming Li and Dongdai Lin
In this paper, we discuss the adjacency graph of feedback shift registers (FSRs) whose characteristic polynomial can be written as $g=(x_0+x_1)*f$ for some linear function $f$. For $f$ contains an odd...
View ArticleRevisiting Conditional R\'enyi Entropies and Generalizing Shannon's Bounds in...
Information theoretic cryptography is discussed based on conditional R\'enyi entropies. Our discussion focuses not only on cryptography but also on the definitions of conditional R\'enyi entropies and...
View ArticleReducing the Complexity of Normal Basis Multiplication, by Omer Egecioglu and...
In this paper we introduce a new transformation method and a multiplication algorithm for multiplying the elements of the field GF$(2^k)$ expressed in a normal basis. The number of XOR gates for the...
View ArticleAnalytic Toolbox for White-Box Implementations: Limitation and Perspectives,...
White-box cryptography is an obfuscation technique to protect the secret key in the software implementations even if an adversary has full access to the implementation of the encryption algorithm and...
View ArticleEfficient Implementation of Keyless Signatures with Hash Sequence...
We present new ideas for decreasing the size of secure memory needed for hardware implementations of hash-sequence based signatures proposed recently by Buldas, Laanoja and Truu (in the following...
View ArticleEfficient Interval Check in the Presence of Malicious Adversaries, by...
We consider the following problem: Assuming that Alice and Bob have an integer interval $[a, e]$ and an integer $b$ respectively, for a commitment $c$ to $b$, Alice and Bob jointly check whether $b$ is...
View ArticleIntegration of hardware tokens in the Idemix library, by Antonio de la Piedra
The Idemix library provides the implementation of the Camenisch-Lysyanskaya (CL) Attribute-based Credential System (ABC), its protocol extensions and the U-Prove ABC. In the case of the CL ABC, the...
View ArticleExtending Oblivious Transfer Efficiently, or - How to get active security...
On top of the passively secure extension protocol of [IKNP03] we build a new construction secure against active adversaries. We can replace the invocation of the hash function that is used to check the...
View ArticleOptimal Proximity Proofs, by Ioana Boureanu and Serge Vaudenay
Provably secure distance-bounding is a rising subject, yet an unsettled one; indeed, very few distance-bounding protocols, with formal security proofs, have been proposed. In fact, so far only two...
View ArticleMalicious Hashing: Eve's Variant of SHA-1, by Ange Albertini and...
We present collisions for a version of SHA-1 with modified constants, where the colliding payloads are valid binary files. Examples are given of colliding executables, archives, and images. Our...
View ArticleProof of Proximity of Knowledge, by Serge Vaudenay
Public-key distance bounding schemes are needed to defeat relay attacks in payment systems. So far, only two such schemes exist, but fail to fully protect against malicious provers. In this paper, we...
View ArticleSecurity Proofs for the BLT Signature Scheme, by Ahto Buldas and Risto...
We present security proofs for the BLT signature scheme in the model, where hash functions are built from ideal components (random oracles, ideal ciphers, etc.). We show that certain strengthening of...
View ArticleA Fully Homomorphic Encryption Scheme with Better Key Size, by Zhigang Chen,...
Fully homomorphic encryption is faced with two problems now. One is candidate fully homomorphic encryption schemes are few. Another is that the efficiency of fully homomorphic encryption is a big...
View ArticleHIMMO security, by Oscar Garcia-Morchon and Ronald Rietman and Ludo Tolhuizen...
This paper describes HIMMO, an identity-based pairwise symmetric key establishment method. The acronym "HIMMO" is derived from two interpolation problems that are essential for the security of the...
View Article