20 search results - page 2 / 4 » On Deniability in the Common Reference String and Random Ora... |
SACRYPT
2004
Springer
13 years 10 months 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...
TCC
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. A protocol compiler is described, that transforms any provably secure authenticated 2-party key establishment into a provably secure authenticated group key establishment...
TCC
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. We study the necessary and sufficient assumptions for universally composable (UC) computation, both in terms of setup and computational assumptions. We look at the common...
FOCS
2007
IEEE
13 years 11 months ago
2007
IEEE
The Common Reference String (CRS) model equips all protocol participants with a common string that is sampled from a pre-specified distribution, say the uniform distribution. Thi...
TCC
2009
Springer
14 years 5 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...