Sciweavers

3115 search results - page 179 / 623
» Synthesizing Secure Protocols
Sort
View
141
Voted
HICSS
2005
IEEE
137views Biometrics» more  HICSS 2005»
15 years 9 months ago
Sliding Window Protocol for Group Communication in Ad-Hoc Networks
Existing ad hoc routing protocols are either unicast or multicast. In this paper we propose a simple extension to the Dynamic Source Routing Protocol (DSR) to cater for group comm...
In Joe Khor, Johnson P. Thomas, Istvan Jonyer
CTRSA
2006
Springer
129views Cryptology» more  CTRSA 2006»
15 years 7 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
ASYNC
2005
IEEE
132views Hardware» more  ASYNC 2005»
15 years 9 months ago
High Level Synthesis of Timed Asynchronous Circuits
This paper proposes applying a logic synthesis approach to high level synthesis from SpecC specifications to timed asynchronous gate-level circuits. The state-based logic synthes...
Tomohiro Yoneda, Atsushi Matsumoto, Manabu Kato, C...
JUCS
2008
149views more  JUCS 2008»
15 years 3 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 4 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