Sciweavers

346 search results - page 46 / 70
» Security Arguments for Digital Signatures and Blind Signatur...
Sort
View
IACR
2011
136views more  IACR 2011»
14 years 1 months ago
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
We give new methods for generating and using “strong trapdoors” in cryptographic lattices, which are simultaneously simple, efficient, easy to implement (even in parallel), a...
Daniele Micciancio, Chris Peikert
113
Voted
CSR
2009
Springer
15 years 8 months ago
A Feebly Secure Trapdoor Function
Abstract. In 1992, A. Hiltgen [1] provided the first constructions of provably (slightly) secure cryptographic primitives, namely feebly one-way functions. These functions are pro...
Edward A. Hirsch, Sergey I. Nikolenko
GI
2005
Springer
15 years 7 months ago
Security Extensions to MMARP Through Cryptographically Generated Addresses
: The MMARP protocol provides multicast routing in hybrid environments in which an ad hoc network is connected to the Internet. As many other routing protocols it was initially des...
Francisco J. Galera, Pedro M. Ruiz, Antonio F. G&o...
112
Voted
NORDSEC
2009
Springer
15 years 6 months ago
Formal Analysis of the Estonian Mobile-ID Protocol
In this paper, we report the results of the formal analysis performed on the Estonian Mobile-ID protocol (deployed since 2008), allowing citizens and permanent residents of Estonia...
Peeter Laud, Meelis Roos
AC
1997
Springer
15 years 6 months ago
Cryptographic Primitives for Information Authentication - State of the Art
This paper describes the state of the art for cryptographic primitives that are used for protecting the authenticity of information: cryptographic hash functions and digital signat...
Bart Preneel