Sciweavers

324 search results - page 55 / 65
» A new signature scheme without random oracles
Sort
View
IACR
2011
173views more  IACR 2011»
12 years 8 months ago
All-But-Many Lossy Trapdoor Functions
We put forward a generalization of lossy trapdoor functions (LTFs). Namely, all-but-many lossy trapdoor functions (ABM-LTFs) are LTFs that are parametrized with tags. Each tag can...
Dennis Hofheinz
CRYPTO
2010
Springer
171views Cryptology» more  CRYPTO 2010»
13 years 9 months ago
Credential Authenticated Identification and Key Exchange
Secure two-party authentication and key exchange are fundamental problems. Traditionally, the parties authenticate each other by means of their identities, using a public-key infr...
Jan Camenisch, Nathalie Casati, Thomas Groß,...
FOCS
2007
IEEE
14 years 2 months ago
Covert Multi-Party Computation
In STOC’05, Ahn, Hopper and Langford introduced the notion of covert computation. A covert computation protocol is one in which parties can run a protocol without knowing if oth...
Nishanth Chandran, Vipul Goyal, Rafail Ostrovsky, ...
PROVSEC
2007
Springer
14 years 2 months ago
Stronger Security of Authenticated Key Exchange
In this paper we study security definitions for authenticated key exchange (AKE) protocols. We observe that there are several families of attacks on AKE protocols that lie outsid...
Brian A. LaMacchia, Kristin Lauter, Anton Mityagin
ACSAC
2007
IEEE
14 years 2 months ago
MetaAware: Identifying Metamorphic Malware
Detection of malicious software (malware) by the use of static signatures is often criticized for being overly simplistic. Available methods of obfuscating code (so-called metamor...
Qinghua Zhang, Douglas S. Reeves