1769 search results - page 213 / 354 » Cryptography |
116
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
Abstract. We present a deep embedding of Bellantoni and Cook’s syntactic characterization of polytime functions. We prove formally that it is correct and complete with respect to...
144
click to vote
IACR
2011
14 years 3 months ago
2011
: Many identity-based digital signature schemes using bilinear pairings have been proposed. But the relative computation cost of the pairing is approximately twenty times higher th...
294
click to vote
INFOCOM
2012
IEEE
14 years 2 months ago
2012
IEEE
We derive bounds on the expected loss for authentication protocols in channels which are constrained due to noisy
conditions and communication costs. This is motivated by a
numbe...
148
click to vote
EUROCRYPT
2012
Springer
13 years 6 months ago
2012
Springer
Decoding random linear codes is a well studied problem with many applications in complexity theory and cryptography. The security of almost all coding and LPN/LWE-based schemes rel...
229
click to vote
ICDE
2007
IEEE
16 years 5 months ago
2007
IEEE
Networked information systems require strong security guarantees because of the new threats that they face. Various forms of encryption have been proposed to deal with this proble...