67 search results - page 12 / 14 » Common Substrings in Random Strings |
CRYPTO
2003
Springer
14 years 20 days ago
2003
Springer
Abstract. Cryptographic systems often involve running multiple concurrent instances of some protocol, where the instances have some amount of joint state and randomness. (Examples ...
EUROCRYPT
2007
Springer
14 years 1 months ago
2007
Springer
sion of an extended abstract to be published in Advances in Cryptology—EUROCRYPT 2007, Springer-Verlag, 2007. Available online from the IACR Cryptology ePrint Archive as Report 2...
IACR
2011
12 years 7 months ago
2011
Fully homomorphic encryption (FHE) provides a simple template for secure computation between two parties (Alice and Bob) where: (I) Alice encrypts her input under her key, (II) Bo...
CCS
2010
ACM
13 years 7 months ago
2010
ACM
Protocols for password-based authenticated key exchange (PAKE) allow two users who share only a short, low-entropy password to agree on a cryptographically strong session key. The...
CEC
2010
IEEE
13 years 8 months ago
2010
IEEE
At the current state of the art, genetic programs do not contain two constructs that commonly occur in programs written by humans, that is, loops and functions with parameters. In ...