Sciweavers

106 search results - page 10 / 22
» Trusted Multiplexing of Cryptographic Protocols
Sort
View
FC
2003
Springer
101views Cryptology» more  FC 2003»
14 years 21 days ago
Fully Private Auctions in a Constant Number of Rounds
Abstract. We present a new cryptographic auction protocol that prevents extraction of bid information despite any collusion of participants. This requirement is stronger than commo...
Felix Brandt
EUROPKI
2009
Springer
13 years 5 months ago
Automatic Generation of Sigma-Protocols
Efficient zero-knowledge proofs of knowledge (ZK-PoK) are basic building blocks of many cryptographic applications such as identification schemes, group signatures, and secure mult...
Endre Bangerter, Thomas Briner, Wilko Henecka, Ste...
OSDI
2002
ACM
14 years 7 months ago
FARSITE: Federated, Available, and Reliable Storage for an Incompletely Trusted Environment
Farsite is a secure, scalable file system that logically functions as a centralized file server but is physically distributed among a set of untrusted computers. Farsite provides ...
Atul Adya, William J. Bolosky, Miguel Castro, Gera...
AINA
2005
IEEE
14 years 1 months ago
Designing Secure Wireless Mobile Ad Hoc Networks
In recent years, security in MANET is anticipated as the pre-establishment of specific information among the participating nodes, so that the future communications can be secured ...
Venkatesan Balakrishnan, Vijay Varadharajan
STOC
1996
ACM
185views Algorithms» more  STOC 1996»
13 years 11 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...