Sciweavers

659 search results - page 26 / 132
» Compiling and securing cryptographic protocols
Sort
View
113
Voted
ASIACRYPT
2010
Springer
14 years 10 months ago
Optimistic Concurrent Zero Knowledge
We design cryptographic protocols that recognize best case (optimistic) situations and exploit them. As a case study, we present a new concurrent zeroknowledge protocol that is exp...
Alon Rosen, Abhi Shelat
112
Voted
TCC
2007
Springer
125views Cryptology» more  TCC 2007»
15 years 6 months ago
Concurrently-Secure Blind Signatures Without Random Oracles or Setup Assumptions
Abstract. We show a new protocol for blind signatures in which security is preserved even under arbitrarily-many concurrent executions. The protocol can be based on standard crypto...
Carmit Hazay, Jonathan Katz, Chiu-Yuen Koo, Yehuda...
116
Voted
ISICT
2003
15 years 1 months ago
Analysis of a mobile communication security protocol
: Cryptographic protocols are used to achieve secure communication over insecure networks. Weaknesses in such protocols are hard to identify, as they can be the result of subtle de...
Tom Coffey, Reiner Dojen
105
Voted
CCS
2010
ACM
14 years 9 months ago
Cap unification: application to protocol security modulo homomorphic encryption
We address the insecurity problem for cryptographic protocols, for an active intruder and a bounded number of sessions. The protocol steps are modeled as rigid Horn clauses, and t...
Siva Anantharaman, Hai Lin, Christopher Lynch, Pal...
118
Voted
FC
2008
Springer
134views Cryptology» more  FC 2008»
15 years 2 months ago
Generalized Non-Interactive Oblivious Transfer Using Count-Limited Objects with Applications to Secure Mobile Agents
Oblivious transfer (OT) is a fundamental primitive used in many cryptographic protocols, including general secure function evaluation (SFE) protocols. However, interaction is a pri...
Vandana Gunupudi, Stephen R. Tate