Sciweavers

1777 search results - page 80 / 356
» Programming Cryptographic Protocols
Sort
View
ICCCN
2007
IEEE
14 years 3 months ago
Safeguarding Mutable Fields in AODV Route Discovery Process
— Assuring cryptographic integrity of mutable fields in any on-demand ad hoc routing protocol is more challenging than that of non mutable fields. We propose an efficient auth...
Kulasekaran A. Sivakumar, Mahalingam Ramkumar
AINA
2006
IEEE
14 years 2 months ago
Dual RSA Accumulators and Its Application for Private Revocation Check
This paper points out the privacy issue in the OCSP (Online Certificate Status Protocol), namely, the OCSP responder learns confidential information – who sends a message to w...
Hiroaki Kikuchi
AINTEC
2006
Springer
14 years 15 days ago
Proactive Resilience to Dropping Nodes in Mobile Ad Hoc Networks
Abstract. Proactive routing protocols for mobile ad hoc networks currently offer few mechanisms to detect and/or counter malevolent nodes. Stability and performance of most, if not...
Ignacy Gawedzki, Khaldoun Al Agha
CRYPTO
2006
Springer
97views Cryptology» more  CRYPTO 2006»
14 years 13 days ago
Robust Multiparty Computation with Linear Communication Complexity
We present a robust multiparty computation protocol. The protocol is for the cryptographic model with open channels and a polytime adversary, and allows n parties to actively secur...
Martin Hirt, Jesper Buus Nielsen
CTRSA
2006
Springer
156views Cryptology» more  CTRSA 2006»
14 years 13 days ago
Universally Composable Oblivious Transfer in the Multi-party Setting
We construct efficient universally composable oblivious transfer protocols in the multi-party setting for honest majorities. Unlike previous proposals our protocols are designed in...
Marc Fischlin