Concept

Public key certificate

Related publications (125)

SAS-Based Group Authentication and Key Agreement Protocols

New trends in consumer electronics have created a strong demand for fast, reliable and user-friendly key agreement protocols. However, many key agreement protocols are secure only against passive attacks. Therefore, message authentication is often unavoida ...

Springer2008

Direct observation of reaction intermediates for a well defined heterogeneous alkene metathesis catalyst

Frédéric Blanc, David Lyndon Emsley, Rajkumar Singh

Grafting of [W( NAr)(=CHtBu)(2,5-Me2NC4H2)(2)] on a silica partially clehydroxylated at 700 degrees C (SiO2-(700)) generates the corresponding monosiloxy complex [( SiO)W( NAr)(=CHtBu)(2,5-Me2NC4H2)] as the major species (approximate to 90%) along with [( ...

NATL ACAD SCIENCES2008

Mechanical stabilisation and design optimisation of masks for stencil lithography: Numerical approach and experimental validation

Jürgen Brugger, Andreea Veronica Savu, Marc Antonius Friedrich van den Boogaart

This paper addresses mask deformation phenomenon that frequently occurs but is highly undesirable in stencil lithography. Previously, a technique for mechanical stabilisation of stencils was proposed [M.A.F. van den Boogaart, et al., Corrugated membranes f ...

2008

Chosen-prefix collisions for MD5 and colliding X.509 certificates for different identities

Arjen Lenstra

We present a novel, automated way to find differential paths for MD5. As an application we have shown how, at an approximate expected cost of 2 50 calls to the MD5 compression function, for any two chosen message prefixes P and P′, suffixe ...

2007

Provable Security in Cryptography

Thomas Baignères

These lecture notes are a compilation of some of my readings while I was preparing two lectures given at EPFL on provable security in cryptography. They are essentially based on a book chapter from David Pointcheval called “Provable Security for Public Key ...

2007

Cryptanalysis of the Sidelnikov cryptosystem

Mohammad Amin Shokrollahi, Lorenz Minder

We present a structural attack against the Sidelnikov cryptosystem. The attack creats a private key from a give public key. Its running time is subexponential and it is effective if the parameters of the Reed-Muller code allow for efficient sampling of min ...

Springer Verlag2007

Position-flexible elaboration of halogenated heterocycles: Metalated species as key intermediates for synthesis

Halogens, in particular fluorine atoms, are favorite tools to fine-tune the chemical and biological properties of pharmaceutical or agricultural development products. At the same time, such an electronegative substituent can effectively assist the site-sel ...

2007

Specification, estimation and validation of a pedestrian walking behavior model

Michel Bierlaire, Gianluca Antonini, Javier Cruz Mota, Thomas Robin

We propose and validate a model for pedestrian walking behavior, based on discrete choice modeling. Two main types of behavior are identified: unconstrained and constrained. By unconstrained, we refer to behavior patterns which are independent from other i ...

2007

Oscar: Small-world overlay for realistic key distributions

Karl Aberer, Anwitaman Datta, Sarunas Girdzijauskas

The research on P2P systems which support skewed key distributions has rapidly advanced in the recent years. Yet, the assumptions on the skews we are dealing with remained pretty simple: most of the existing literature assumes simple monotonous key distrib ...

2006

Integrity (I) codes: Message Integrity Protection and Authentication over Insecure Channels

Jean-Pierre Hubaux, Mario Cagalj, Srdan Capkun

Inspired by unidirectional error detecting codes that are used in situations where only one kind of bit errors are possible (e.g., it is possible to change a bit “0” into a bit “1”, but not the contrary), we propose integrity codes (I-codes) for a radio co ...

2006

Graph Chatbot

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.