Sciweavers

93 search results - page 11 / 19
» On Some Cryptographic Properties of Rijndael
Sort
View
ICS
2010
Tsinghua U.
15 years 7 months ago
Proof-Carrying Data and Hearsay Arguments from Signature Cards
: Design of secure systems can often be expressed as ensuring that some property is maintained at every step of a distributed computation among mutually-untrusting parties. Special...
Alessandro Chiesa, Eran Tromer
88
Voted
CCS
2000
ACM
15 years 1 months ago
Composition and integrity preservation of secure reactive systems
We consider compositional properties of reactive systems that are secure in a cryptographic sense. We follow the wellknown simulatability approach, i.e., the specification is an ...
Birgit Pfitzmann, Michael Waidner
TCC
2007
Springer
102views Cryptology» more  TCC 2007»
15 years 3 months ago
Universally Composable Security with Global Setup
Abstract. Cryptographic protocols are often designed and analyzed under some trusted set-up assumptions, namely in settings where the participants have access to global information...
Ran Canetti, Yevgeniy Dodis, Rafael Pass, Shabsi W...
ITCC
2005
IEEE
15 years 3 months ago
Applications of The Montgomery Exponent
We define here the Montgomery Exponent of order s, modulo the odd integer N, by MEXP = MEXP(A, X, N, s) = AX 2−s(X−1) (mod N), and illustrate some properties and usage of thi...
Shay Gueron, Or Zuk
82
Voted
TCC
2004
Springer
118views Cryptology» more  TCC 2004»
15 years 2 months ago
A General Composition Theorem for Secure Reactive Systems
Abstract. We consider compositional properties of reactive systems that are secure in a cryptographic sense. We follow the well-known simulatability approach of modern cryptography...
Michael Backes, Birgit Pfitzmann, Michael Waidner