Sciweavers

1853 search results - page 92 / 371
» Cryptographic Protocols and Network Security
Sort
View
129
Voted
BROADNETS
2006
IEEE
15 years 10 months ago
How to Specify and How to Prove Correctness of Secure Routing Protocols for MANET
Secure routing protocols for mobile ad hoc networks have been developed recently, yet, it has been unclear what are the properties they achieve, as a formal analysis of these prot...
Panagiotis Papadimitratos, Zygmunt J. Haas, Jean-P...
WECWIS
2005
IEEE
116views ECommerce» more  WECWIS 2005»
15 years 9 months ago
Security and Privacy Using One-Round Zero-Knowledge Proofs
A zero-knowledge proof (ZKP) is an interactive proof that allows a prover to prove the knowledge of a secret to a verifier without revealing it. ZKPs are powerful tools to deal wi...
Sultan Almuhammadi, Clifford Neuman
CTRSA
2008
Springer
111views Cryptology» more  CTRSA 2008»
15 years 6 months ago
Efficient Fully-Simulatable Oblivious Transfer
Oblivious transfer, first introduced by Rabin, is one of the basic building blocks of cryptographic protocols. In an oblivious transfer (or more exactly, in its 1-out-of-2 variant...
Andrew Y. Lindell
WPES
2003
ACM
15 years 9 months ago
Leveraging the "Multi" in secure multi-party computation
Secure Multi-Party Computation enables parties with private data to collaboratively compute a global function of their private data, without revealing that data. The increase in s...
Jaideep Vaidya, Chris Clifton
ASWEC
2006
IEEE
15 years 10 months ago
Formally Analysing a Security Protocol for Replay Attacks
The Kerberos-One-Time protocol is a key distribution protocol promoted for use with Javacards to provide secure communication over the GSM mobile phone network. From inspection we...
Benjamin W. Long, Colin J. Fidge