E-Passport Threats

About
Privacy
Disclaimer

Graph Chatbot

Related publications (30)

Page 2 of 2

An FPGA-Based 4 Mbps Secret Key Distillation Engine for Quantum Key Distribution Systems

Andreas Peter Burg, Pascal Junod, Jeremy Hugues-Felix Constantin, Nicholas Alexander Preyss

Quantum key distribution (QKD) enables provably secure communication between two parties over an optical fiber that arguably withstands any form of attack. Besides the need for a suitable physical signalling scheme and the corresponding devices, QKD also r ...

Springer2017

Efficient Public-Key Distance Bounding Protocol

Serge Vaudenay, Handan Kilinç Alper

Distance bounding protocols become more and more important because they are the most accurate solution to defeat relay attacks. They consist of two parties: a verifier and a prover. The prover shows that (s)he is close enough to the verifier. In some appli ...

Springer-Verlag Berlin2016

Instruction Set Extensions for Secure Applications

Paolo Ienne, Francesco Regazzoni

The main goal of this paper is to expose the community to past achievements and future possible uses of Instruction Set Extension (ISE) in security applications. Processor customization has proven to be an effective way for achieving high performance with ...

Ieee2016

Computational Aspects of Jacobians of Hyperelliptic Curves

Alina Dudeanu

Nowadays, one area of research in cryptanalysis is solving the Discrete Logarithm Problem (DLP) in finite groups whose group representation is not yet exploited. For such groups, the best one can do is using a generic method to attack the DLP, the fastest ...

EPFL2016

Bringing Theory Closer to Practice in Post-quantum and Leakage-resilient Cryptography

Alexandre Raphaël Duc

Modern cryptography pushed forward the need of having provable security. Whereas ancient cryptography was only relying on heuristic assumptions and the secrecy of the designs, nowadays researchers try to make the security of schemes to rely on mathematical ...

EPFL2015

Efficient Ephemeral Elliptic Curve Cryptographic Keys

Arjen Lenstra, Andrea Miele

We show how any pair of authenticated users can on-the-fly agree on an elliptic curve group that is unique to their communication session, unpredictable to outside observers, and secure against known attacks. Our proposal is suitable for deployment on cons ...

Springer-Verlag Berlin2015

The Chaining Lemma and Its Application

Sebastian Faust

We present a new information-theoretic result which we call the Chaining Lemma. It considers a so-called "chain" of random variables, defined by a source distribution X-(0) with high min-entropy and a number (say, t in total) of arbitrary functions (T-1,.. ...

Springer-Verlag Berlin2015

On the Analysis of Public-Key Cryptologic Algorithms

Andrea Miele

The RSA cryptosystem introduced in 1977 by Ron Rivest, Adi Shamir and Len Adleman is the most commonly deployed public-key cryptosystem. Elliptic curve cryptography (ECC) introduced in the mid 80's by Neal Koblitz and Victor Miller is becoming an increasin ...

EPFL2015

Automatic Application of Power Analysis Countermeasures

Paolo Ienne, Philip Brisk, Francesco Regazzoni, David Novo Bruna, Ali Galip Bayrak

We introduce a compiler that automatically inserts software countermeasures to protect cryptographic algorithms against power-based side-channel attacks. The compiler first estimates which instruction instances leak the most information through side-channe ...

Institute of Electrical and Electronics Engineers2015

Secure communication using authenticated channels

Sylvain Pasini

Our main motivation is to design more user-friendly security protocols. Indeed, if the use of the protocol is tedious, most users will not behave correctly and, consequently, security issues occur. An example is the actual behavior of a user in front of an ...

EPFL2009