132 search results - page 6 / 27 » New and improved constructions of non-malleable cryptographi... |
EUROCRYPT
2008
Springer
13 years 9 months ago
2008
Springer
The Universal Composability framework was introduced by Canetti to study the security of protocols which are concurrently executed with other protocols in a network environment. U...
FC
2010
Springer
13 years 11 months ago
2010
Springer
This paper presents compact message formats for onion routing circuit construction using the Sphinx methodology developed for mixes. We significantly compress the circuit constru...
SEC
2001
13 years 9 months ago
2001
Abstract Traditionally, research in secure group key agreement focuses on minimizing the computational overhead for cryptographic operations, and minimizing the communication overh...
CCS
2001
ACM
13 years 11 months ago
2001
ACM
We present a mathematical construct which provides a cryptographic protocol to verifiably shuffle a sequence of k modular integers, and discuss its application to secure, universa...
JOC
2010
13 years 6 months ago
2010
Elliptic curves with small embedding degree and large prime-order subgroup are key ingredients for implementing pairingbased cryptographic systems. Such “pairing-friendly” curv...