Publications related to Efficient Public-Key Distance Bounding Protocol

Signature Schemes Secure Against Hard-to-Invert Leakage

Side-channel attacks allow the adversary to gain partial knowledge of the secret key when cryptographic protocols are implemented in real-world hardware. The goal of leakage resilient cryptography is to design cryptosystems that withstand such attacks. In ...

Springer2016

Keeping Authorities “Honest or Bust” with Decentralized Witness Cosigning

Bryan Alexander Ford, Linus Gasser, Philipp Svetolik Jovanovic, Nicolas Gailly, Ismail Khoffi

Abstract—The secret keys of critical network authorities – such as time, name, certificate, and software update services – represent high-value targets for hackers, criminals, and spy agencies wishing to use these keys secretly to compromise other hosts. T ...

Ieee2016

Method for privacy-preserving medical risk test

Jean-Pierre Hubaux, Amalio Telenti, Erman Ayday, Jean Louis Raisaro

A privacy-preserving method for performing a disease susceptibility test on a patient, said method comprising: (I) performing homomorphic computations, (J) obtaining a test result which is partly decrypted with a first part (prk1 resp. prk2) of a private k ...

2016

The Case for RackOut: Scalable Data Serving Using Rack-Scale Systems

Babak Falsafi, Edouard Bugnion, Boris Robert Grot, Alexandros Daglis, Stanko Novakovic

To provide low latency and high throughput guarantees, most large key-value stores keep the data in the memory of many servers. Despite the natural parallelism across lookups, the load imbalance, introduced by heavy skew in the popularity distribution of k ...

2016

When Constant-time Source Yields Variable-time Binary: Exploiting Curve25519-donna Built with MSVC 2015

Serge Vaudenay

The elliptic curve Curve25519 has been presented as pro- tected against state-of-the-art timing attacks [2]. This paper shows that a timing attack is still achievable against a particular X25519 implemen- tation which follows the RFC 7748 requirements [11] ...

Springer Int Publishing Ag2016

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

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

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

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

Springer Verlag2015

Privacy-Preserving Photo Sharing based on a Public Key Infrastructure

Touradj Ebrahimi, Lin Yuan, David Mc Nally

A significant number of pictures are posted to social media sites or exchanged through instant messaging and cloud-based sharing services. Most social media services offer a range of access control mechanisms to protect users privacy. As it is not in the b ...

Spie-Int Soc Optical Engineering2015

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

Optimal polynomial blow up range for critical wave maps

Can Gao

We prove that the critical Wave Maps equation with target

S^2

and origin ℝ

^{2+1}

admits energy class blow up solutions of the form [ u(t, r) = Q(\lambda(t)r) + \epsilon(t, r) ] where

Q:ℝ²\rightarrow S^2

is the ground state harmonic map and $\lambda ...

EPFL2015

Efficient Public-Key Distance Bounding Protocol

Graph Chatbot

Chat with Graph Search

Signature Schemes Secure Against Hard-to-Invert Leakage

Keeping Authorities “Honest or Bust” with Decentralized Witness Cosigning

Method for privacy-preserving medical risk test

The Case for RackOut: Scalable Data Serving Using Rack-Scale Systems

When Constant-time Source Yields Variable-time Binary: Exploiting Curve25519-donna Built with MSVC 2015

Efficient Ephemeral Elliptic Curve Cryptographic Keys

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

Privacy-Preserving Photo Sharing based on a Public Key Infrastructure

On the Analysis of Public-Key Cryptologic Algorithms

Optimal polynomial blow up range for critical wave maps

Efficient Ephemeral Elliptic Curve Cryptographic Keys

Keeping Authorities “Honest or Bust” with Decentralized Witness Cosigning

Signature Schemes Secure Against Hard-to-Invert Leakage

The Case for RackOut: Scalable Data Serving Using Rack-Scale Systems

Optimal polynomial blow up range for critical wave maps

On the Analysis of Public-Key Cryptologic Algorithms

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

Privacy-Preserving Photo Sharing based on a Public Key Infrastructure

Method for privacy-preserving medical risk test

When Constant-time Source Yields Variable-time Binary: Exploiting Curve25519-donna Built with MSVC 2015