67 search results - page 11 / 14 » Common Substrings in Random Strings |
CORR
2011
Springer
13 years 2 months ago
2011
Springer
—We consider the zero-error capacity of deletion channels. Specifically, we consider the setting where we choose a codebook C consisting of strings of n bits, and our model of t...
SACRYPT
2004
Springer
14 years 24 days ago
2004
Springer
A reasonably efficient password based key exchange (KE) protocol with provable security without random oracle was recently proposed by Katz, et al. [18] and later by Gennaro and Li...
CRYPTO
2012
Springer
11 years 10 months ago
2012
Springer
It is notoriously difficult to create hardware that is immune from side channel and tampering attacks. A lot of recent literature, therefore, has instead considered algorithmic de...
TCC
2009
Springer
14 years 8 months ago
2009
Springer
Existing definitions of program obfuscation do not rule out malleability attacks, where an adversary that sees an obfuscated program is able to generate another (potentially obfus...
STOC
1998
ACM
13 years 11 months ago
1998
ACM
A commitment protocol is a fundamental cryptographic primitive used as a basic buildingblock throughoutmodern cryptography. In STOC 1991, Dolev Dwork and Naor showed that in many ...