Sciweavers

671 search results - page 98 / 135
» A Modeling Framework for Generating Security Protocol Specif...
Sort
View
TIT
2008
164views more  TIT 2008»
13 years 9 months ago
Cryptographic Hardness Based on the Decoding of Reed-Solomon Codes
We investigate the decoding problem of Reed-Solomon (RS) Codes, also known as the Polynomial Reconstruction Problem (PR), from a cryptographic hardness perspective. Namely, we dea...
Aggelos Kiayias, Moti Yung
ASIACRYPT
2009
Springer
14 years 4 months ago
Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
We demonstrate how the framework that is used for creating efficient number-theoretic ID and signature schemes can be transferred into the setting of lattices. This results in cons...
Vadim Lyubashevsky
JOC
2011
104views more  JOC 2011»
13 years 20 days ago
Short Undeniable Signatures Based on Group Homomorphisms
This paper is devoted to the design and analysis of short undeniable signatures based on a random oracle. Exploiting their online property, we can achieve signatures with a fully s...
Jean Monnerat, Serge Vaudenay
CAINE
2008
13 years 11 months ago
Towards Multiservice Sensor Networks
Sensor networks have been used in many applications such as health monitoring, structural monitoring, transportation networks, weather prediction, and border security. In most of ...
Rabie Ramadan, Bilal I. AlQudah
FASE
2009
Springer
14 years 1 months ago
Certification of Smart-Card Applications in Common Criteria
This paper describes the certification of smart-card applications in the framework of Common Criteria. In this framework, a smart-card application is represented by a model of its...
Iman Narasamdya, Michaël Périn