Sciweavers

5488 search results - page 230 / 1098
» On the Secure Implementation of Security Protocols
Sort
View
CRYPTO
2008
Springer
165views Cryptology» more  CRYPTO 2008»
15 years 8 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 9 months 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...
STOC
1996
ACM
185views Algorithms» more  STOC 1996»
15 years 10 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...
ISECS
2008
IEEE
16 years 1 months ago
Attacks on Two Buyer-Seller Watermarking Protocols and an Improvement for Revocable Anonymity
Buyer-seller watermarking protocols incorporate digital watermarking with cryptography, in order to protect digital copyrights and privacy rights for the seller and the buyer befo...
Mina Deng, Bart Preneel
CSFW
2005
IEEE
16 years 6 days ago
Compositional Analysis of Contract Signing Protocols
We develop a general method for proving properties of contract-signing protocols using a specialized protocol logic. The method is applied to the Asokan-ShoupWaidner and the Garay...
Michael Backes, Anupam Datta, Ante Derek, John C. ...