Publications associées à Secure and Efficient Cryptographic Algorithms in a Quantum World

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Short Stickelberger Class Relations and Application to Ideal-SVP

Benjamin Pierre Charles Wesolowski

The worst-case hardness of finding short vectors in ideals of cyclotomic number fields (Ideal-SVP) is a central matter in lattice based cryptography. Assuming the worst-case hardness of Ideal-SVP allows to prove the Ring-LWE and Ring-SIS assumptions, and t ...

Springer International Publishing Ag2017

STEP-NC compliant process planning of additive manufacturing: remanufacturing

Ian Anthony Stroud, Jumyung Um

Additive manufacturing is becoming one of the key methods for reproducing repair sections in remanufacturing processes. The major advantage of using additive processes is to minimize production time and waste. However, the surface quality and shape accurac ...

Springer London Ltd2017

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

DES S-box generator

Serge Vaudenay, Lauren De Meyer

The Data Encryption Standard (DES) is a cryptographic algorithm, designed by IBM, that was selected to be the national standard in 1977 by the National Bureau of Standards. The algorithm itself was entirely published but the design criteria were kept secre ...

Taylor & Francis Inc2016

Clever Arbiters Versus Malicious Adversaries

Serge Vaudenay

When moving from known-input security to chosen-input security, some generic attacks sometimes become possible and must be discarded by a specific set of rules in the threat model. Similarly, common practices consist of fixing security systems, once an exp ...

Springer Berlin Heidelberg2016

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

Authenticated Encryption with Variable Stretch

Serge Vaudenay, Damian Vizár, Reza Reyhanitabar

In conventional authenticated-encryption (AE) schemes, the ciphertext expansion, a.k.a.stretch or tag length, is a constant or a parameter of the scheme that must be fixed per key. However, using variable-length tags per key can be desirable in practice or ...

Springer-Verlag Berlin2016

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

Secure and Efficient Cryptographic Algorithms in a Quantum World

Graph Chatbot

Chattez avec Graph Search

Hardware Attacks against Hash-based Cryptographic Algorithms

Short Stickelberger Class Relations and Application to Ideal-SVP

Indiscreet discrete logarithms

STEP-NC compliant process planning of additive manufacturing: remanufacturing

Efficient Public-Key Distance Bounding Protocol

DES S-box generator

Clever Arbiters Versus Malicious Adversaries

Instruction Set Extensions for Secure Applications

Authenticated Encryption with Variable Stretch

Keeping Authorities “Honest or Bust” with Decentralized Witness Cosigning

Short Stickelberger Class Relations and Application to Ideal-SVP

Authenticated Encryption with Variable Stretch

Hardware Attacks against Hash-based Cryptographic Algorithms

Efficient Public-Key Distance Bounding Protocol

STEP-NC compliant process planning of additive manufacturing: remanufacturing

Clever Arbiters Versus Malicious Adversaries

Indiscreet discrete logarithms

Instruction Set Extensions for Secure Applications

DES S-box generator

Keeping Authorities “Honest or Bust” with Decentralized Witness Cosigning