1777 search results - page 45 / 356 » Programming Cryptographic Protocols |
TIT
2008
15 years 1 months ago
2008
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...
WISTP
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. In this paper we report on the performance of the RSA variants of Brands protocols for zero-knowledge proof and restrictive blinded issuing [1]. The performance is relati...
ACNS
2008
Springer
15 years 7 months ago
2008
Springer
We propose a light-weight protocol for authentication of low-power devices. Our construction PUF-HB merges the positive qualities of two families of authentication functions. PUF ...
109
click to vote
FROCOS
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. In formal approaches, messages sent over a network are usually modeled by terms together with an equational theory, axiomatizing the properties of the cryptographic funct...
138
click to vote
ICISC
2000
15 years 2 months ago
2000
Abstract. This paper gives new examples that exploit the idea of using sparse polynomials with restricted coefficients over a finite ring for designing fast, reliable cryptosystems...