14 search results - page 2 / 3 » A Composition Theorem for Universal One-Way Hash Functions |
FSE
2010
Springer
13 years 10 months ago
2010
Springer
We answer the question of Reyhanitabar et al. from FSE’09 of constructing a domain extension scheme for enhanced target collisionresistant (eTCR) hash functions with sublinear ke...
STOC
2004
ACM
14 years 5 months ago
2004
ACM
We propose a modification to the framework of Universally Composable (UC) security [3]. Our new notion, involves comparing the protocol executions with an ideal execution involvin...
IACR
2011
12 years 5 months ago
2011
We put forward a framework for the modular design and analysis of multi-party protocols. Our framework is called “GNUC” (with the recursive meaning “GNUC’s Not UC”), alr...
FOCS
2003
IEEE
13 years 11 months ago
2003
IEEE
Concurrent general composition relates to a setting where a secure protocol is run in a network concurrently with other, arbitrary protocols. Clearly, security in such a setting i...
ICALP
2007
Springer
13 years 7 months ago
2007
Springer
Adaptive security, while more realistic as an adversarial model, is typically much harder to achieve compared to static security in cryptographic protocol design. Universal composi...