Sciweavers

1777 search results - page 163 / 356
» Programming Cryptographic Protocols
Sort
View
CTRSA
2010
Springer
149views Cryptology» more  CTRSA 2010»
15 years 8 months ago
Usable Optimistic Fair Exchange
Fairly exchanging digital content is an everyday problem. It has been shown that fair exchange cannot be done without a trusted third party (called the Arbiter). Yet, even with a ...
Alptekin Küpçü, Anna Lysyanskaya
CSFW
2009
IEEE
15 years 8 months ago
A Method for Proving Observational Equivalence
—Formal methods have proved their usefulness for analyzing the security of protocols. Most existing results focus on trace properties like secrecy (expressed as a reachability pr...
Véronique Cortier, Stéphanie Delaune
CRYPTO
2007
Springer
162views Cryptology» more  CRYPTO 2007»
15 years 7 months ago
Universally-Composable Two-Party Computation in Two Rounds
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...
Omer Horvitz, Jonathan Katz
EGOV
2007
Springer
15 years 7 months ago
A Trust-Centered Approach for Building E-Voting Systems
eVoting is a challenging approach for increasing eParticipation. However, lack of citizens’ trust seems to be a main obstacle that hinders its successful realization. In this pap...
Athanasios Antoniou, C. Korakas, Christos Manolopo...
IPSN
2007
Springer
15 years 7 months ago
MiniSec: a secure sensor network communication architecture
Secure sensor network communication protocols need to provide three basic properties: data secrecy, authentication, and replay protection. Secure sensor network link layer protoco...
Mark Luk, Ghita Mezzour, Adrian Perrig, Virgil D. ...