Sciweavers

2432 search results - page 158 / 487
» Cryptographic logical relations
Sort
View
101
Voted
IJCAI
1993
15 years 2 months ago
The Range of Applicability of Nonmonotonic Logics for the Inertia Problem
We introduce and use a new methodology for the study of logics for action and change. The methodology allows one to define a taxonomy of reasoning problems, based in particular on...
Erik Sandewall
STACS
2009
Springer
15 years 7 months ago
Generating Shorter Bases for Hard Random Lattices
We revisit the problem of generating a “hard” random lattice together with a basis of relatively short vectors. This problem has gained in importance lately due to new cryptogr...
Joël Alwen, Chris Peikert
118
Voted
ESWS
2009
Springer
15 years 7 months ago
Middleware for Automated Implementation of Security Protocols
We propose a middleware for automated implementation of security protocols for Web services. The proposed middleware consists of two main layers: the communication layer and the se...
Béla Genge, Piroska Haller
SACRYPT
2009
Springer
212views Cryptology» more  SACRYPT 2009»
15 years 7 months ago
Compact McEliece Keys from Goppa Codes
The classical McEliece cryptosystem is built upon the class of Goppa codes, which remains secure to this date in contrast to many other families of codes but leads to very large pu...
Rafael Misoczki, Paulo S. L. M. Barreto
DELTA
2008
IEEE
15 years 7 months ago
An Integrated Validation Environment for Differential Power Analysis
Integrated systems represent the most common solution for storage and transmission of confidential data. However, cryptographic devices can be subject to passive attacks that cons...
Giorgio Di Natale, Marie-Lise Flottes, Bruno Rouze...