Sciweavers

3088 search results - page 161 / 618
» Multichannel Security Protocols
Sort
View
STOC
1996
ACM
185views Algorithms» more  STOC 1996»
14 years 2 months ago
Adaptively Secure Multi-Party Computation
A fundamental problem in designing secure multi-party protocols is how to deal with adaptive adversaries i.e., adversaries that may choose the corrupted parties during the course ...
Ran Canetti, Uriel Feige, Oded Goldreich, Moni Nao...
STOC
2004
ACM
153views Algorithms» more  STOC 2004»
14 years 10 months ago
Bounded-concurrent secure multi-party computation with a dishonest majority
We show how to securely realize any multi-party functionality in a way that preserves security under an a-priori bounded number of concurrent executions, regardless of the number ...
Rafael Pass
TCC
2007
Springer
102views Cryptology» more  TCC 2007»
14 years 4 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...
IJNSEC
2007
204views more  IJNSEC 2007»
13 years 10 months ago
Enhanced DSR for MANET with Improved Secured Route Discovery and QoS
Mobile Ad hoc NETwork (MANET) comprises of nodes, which are free to move randomly, yet cooperate to forward packets between source and destination over a multi-hop wireless networ...
Anil Rawat, Prakash Dattatraya Vyavahare, Ashwani ...
ACNS
2009
Springer
162views Cryptology» more  ACNS 2009»
14 years 4 months ago
Secure Hamming Distance Based Computation and Its Applications
Abstract. This paper examines secure two-party computation of functions which depend only on the Hamming distance of the inputs of the two parties. We present efficient protocols f...
Ayman Jarrous, Benny Pinkas