Sciweavers

3504 search results - page 4 / 701
» Secure protocol composition
Sort
View
CSFW
1999
IEEE
14 years 26 days ago
I/O Automaton Models and Proofs for Shared-Key Communication Systems
The combination of two security protocols, a simple shared-key communication protocol and the Di e-Hellman key distribution protocol, is modeled formally and proved correct. The m...
Nancy A. Lynch
TCC
2007
Springer
112views Cryptology» more  TCC 2007»
14 years 2 months ago
On the Necessity of Rewinding in Secure Multiparty Computation
We investigate whether security of multiparty computation in the information-theoretic setting implies their security under concurrent composition. We show that security in the sta...
Michael Backes, Jörn Müller-Quade, Domin...
FOSSACS
2009
Springer
14 years 3 months ago
Cryptographic Protocol Composition via the Authentication Tests
Although cryptographic protocols are typically analyzed in isolation, they are used in combinations. If a protocol was analyzed alone and shown to meet some security goals, will it...
Joshua D. Guttman
EUROCRYPT
2001
Springer
14 years 1 months ago
How Secure Are Elliptic Curves over Composite Extension Fields?
We compare the method of Weil descent for solving the ECDLP, over extensions fields of composite degree in characteristic two, against the standard method of parallelised Pollard ...
Nigel P. Smart
IACR
2011
147views more  IACR 2011»
12 years 8 months ago
Adaptive Security of Concurrent Non-Malleable Zero-Knowledge
A zero-knowledge protocol allows a prover to convince a verifier of the correctness of a statement without disclosing any other information to the verifier. It is a basic tool a...
Zhenfu Cao, Zongyang Zhang, Yunlei Zhao