242 search results - page 36 / 49 » Randomness in Cryptography |
STOC
2003
ACM
15 years 10 months ago
2003
ACM
We construct binary codes for fingerprinting. Our codes for n users that are -secure against c pirates have length O(c2 log(n/ )). This improves the codes proposed by Boneh and Sh...
103
click to vote
DCC
2005
IEEE
15 years 9 months ago
2005
IEEE
Elliptic curve cryptosystems in the presence of faults were studied by Biehl, Meyer and M?uller (2000). The first fault model they consider requires that the input point P in the c...
71
Voted
TCC
2010
Springer
15 years 6 months ago
2010
Springer
We study rationality in protocol design for the full-information model, a model characterized by computationally unbounded adversaries, no private communication, and no simultanei...
ASIACRYPT
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. The security of cascade blockcipher encryption is an important and well-studied problem in theoretical cryptography with practical implications. It is well-known that dou...
FC
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. A certificate of authenticity (COA) is an inexpensive physical object with a random and unique structure S which is hard to nearexactly replicate. An inexpensive device ...