Sciweavers

4111 search results - page 341 / 823
» Security, Protocols, and Trust
Sort
View
CTRSA
2006
Springer
129views Cryptology» more  CTRSA 2006»
15 years 11 months ago
An Optimal Non-interactive Message Authentication Protocol
Vaudenay recently proposed a message authentication protocol which is interactive and based on short authenticated strings (SAS). We study here SASbased non-interactive message aut...
Sylvain Pasini, Serge Vaudenay
JUCS
2008
149views more  JUCS 2008»
15 years 7 months ago
Formal Security Definition and Efficient Construction for Roaming with a Privacy-Preserving Extension
: In a secure roaming scenario, a user U travels to a foreign network and communicates with a foreign server V securely so that no one other than U and V can obtain the messages ex...
Guomin Yang, Duncan S. Wong, Xiaotie Deng
TCC
2009
Springer
184views Cryptology» more  TCC 2009»
16 years 8 months ago
Secure Arithmetic Computation with No Honest Majority
We study the complexity of securely evaluating arithmetic circuits over finite rings. This question is motivated by natural secure computation tasks. Focusing mainly on the case o...
Yuval Ishai, Manoj Prabhakaran, Amit Sahai
WIMOB
2008
IEEE
16 years 1 months ago
A Mechanism Design-Based Secure Architecture for Mobile Ad Hoc Networks
—To avoid the single point of failure for the certificate authority (CA) in MANET, a decentralized solution is proposed where nodes are grouped into different clusters. Each clu...
Abderrezak Rachedi, Abderrahim Benslimane, Hadi Ot...
CSFW
2004
IEEE
15 years 11 months ago
Formal Analysis of Multi-Party Contract Signing
We analyze the multi-party contract-signing protocols of Garay and MacKenzie (GM) and of Baum and Waidner (BW). We use a finite-state tool, MOCHA, which allows specification of pr...
Rohit Chadha, Steve Kremer, Andre Scedrov