Publications related to On the security of Lenstra's variant of DSA without long inversions

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Improving Stateless Hash-Based Signatures

Jean-Philippe Aumasson

present several optimizations to SPHINCS, a stateless hash-based signature scheme proposed by Bernstein et al. in (2015): PORS, a more secure variant of the HORS few-time signature scheme used in SPHINCS; secret key caching, to speed-up signing and reduce ...

SPRINGER INTERNATIONAL PUBLISHING AG2018

OmniLedger: A Secure, Scale-Out, Decentralized Ledger via Sharding

Bryan Alexander Ford, Linus Gasser, Eleftherios Kokoris Kogias, Philipp Svetolik Jovanovic, Nicolas Gailly

Designing a secure permissionless distributed ledger (blockchain) that performs on par with centralized payment processors, such as Visa, is a challenging task. Most existing distributed ledgers are unable to scale-out, i.e., to grow their total processing ...

2018

Circular Security Reconsidered

Serge Vaudenay, Fatma Betül Durak

The notion of circular security of pseudorandom functions (PRF) was introduced in Distance Bounding Protocols. So far, only a construction based on a random oracle model was proposed. Circular security stands between two new notions which we call Key Depen ...

Springer International Publishing2016

High System-Code Security with Low Overhead

George Candea, Johannes Kinder, Volodymyr Kuznetsov, Jonas Benedict Wagner

Security vulnerabilities plague modern systems because writing secure systems code is hard. Promising approaches can retrofit security automatically via runtime checks that implement the desired security policy; these checks guard critical operations, like ...

2015

Making Masking Security Proofs Concrete - Or How to Evaluate the Security of any Leaking Device

Alexandre Raphaël Duc, Sebastian Faust

We investigate the relationships between theoretical studies of leaking cryptographic devices and concrete security evaluations with standard side-channel attacks. Our contributions are in four parts. First, we connect the formal analysis of the masking co ...

Springer2015

Online Authenticated-Encryption and its Nonce-Reuse Misuse-Resistance

Damian Vizár, Reza Reyhanitabar

A definition of online authenticated-encryption (OAE), call it OAE1, was given by Fleischmann, Forler, and Lucks (2012). It has become a popular definitional target because, despite allowing encryption to be online, security is supposed to be maintained ev ...

Springer2015

Optimal Proximity Proofs Revisited

Serge Vaudenay, Handan Kilinç Alper

Distance bounding protocols become important since wireless technologies become more and more common. Therefore, the security of the distance bounding protocol should be carefully analyzed. However, most of the protocols are not secure or their security is ...

Springer Verlag2015

Game Theory Meets Network Security and Privacy

Jean-Pierre Hubaux

This survey provides a structured and comprehensive overview of research on security and privacy in computer and communication networks that use game-theoretic approaches. We present a selected set of works to highlight the application of game theory in ad ...

Assoc Computing Machinery2013

Secure & Lightweight Distance-Bounding

Serge Vaudenay, Aikaterini Mitrokotsa

Distance-bounding is a practical solution to be used in security-sensitive contexts, mainly to prevent relay attacks. The main challenge when designing such protocols is maintaining their inexpensive cryptographic nature, whilst being able to protect again ...

2013

On the security of Lenstra's variant of DSA without long inversions

Graph Chatbot

Chat with Graph Search

Improving Stateless Hash-Based Signatures

OmniLedger: A Secure, Scale-Out, Decentralized Ledger via Sharding

Circular Security Reconsidered

High System-Code Security with Low Overhead

Making Masking Security Proofs Concrete - Or How to Evaluate the Security of any Leaking Device

Online Authenticated-Encryption and its Nonce-Reuse Misuse-Resistance

Optimal Proximity Proofs Revisited

Secure Communication in Erasure Networks with State-feedback

Game Theory Meets Network Security and Privacy

Secure & Lightweight Distance-Bounding

Improving Stateless Hash-Based Signatures

High System-Code Security with Low Overhead

Secure Communication in Erasure Networks with State-feedback

Circular Security Reconsidered

OmniLedger: A Secure, Scale-Out, Decentralized Ledger via Sharding

Secure & Lightweight Distance-Bounding

Game Theory Meets Network Security and Privacy

Making Masking Security Proofs Concrete - Or How to Evaluate the Security of any Leaking Device

Optimal Proximity Proofs Revisited

Online Authenticated-Encryption and its Nonce-Reuse Misuse-Resistance