Sciweavers

3115 search results - page 152 / 623
» Synthesizing Secure Protocols
Sort
View
CRYPTO
2008
Springer
165views Cryptology» more  CRYPTO 2008»
14 years 11 months ago
Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries
In this work we study the design of secure protocols for linear algebra problems. All current solutions to the problem are either inefficient in terms of communication complexity o...
Payman Mohassel, Enav Weinreb
CSFW
2012
IEEE
13 years 13 days ago
Provably Secure and Practical Onion Routing
The onion routing network Tor is undoubtedly the most widely employed technology for anonymous web access. Although the underlying onion routing (OR) protocol appears satisfactory...
Michael Backes, Ian Goldberg, Aniket Kate, Esfandi...
ASIACRYPT
2001
Springer
15 years 2 months ago
Unbelievable Security. Matching AES Security Using Public Key Systems
The Advanced Encryption Standard (AES) provides three levels of security: 128, 192, and 256 bits. Given a desired level of security for the AES, this paper discusses matching publi...
Arjen K. Lenstra
STOC
1996
ACM
185views Algorithms» more  STOC 1996»
15 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...
TCS
2008
14 years 10 months ago
Efficient corona training protocols for sensor networks
Phenomenal advances in nano-technology and packaging have made it possible to develop miniaturized low-power devices that integrate sensing, special-purpose computing, and wireles...
Alan A. Bertossi, Stephan Olariu, Maria Cristina P...