Sciweavers

1059 search results - page 131 / 212
» Modeling Security Protocols as Games
Sort
View
CTRSA
2006
Springer
156views Cryptology» more  CTRSA 2006»
14 years 1 months ago
Universally Composable Oblivious Transfer in the Multi-party Setting
We construct efficient universally composable oblivious transfer protocols in the multi-party setting for honest majorities. Unlike previous proposals our protocols are designed in...
Marc Fischlin
ACNS
2005
Springer
116views Cryptology» more  ACNS 2005»
14 years 3 months ago
Two-Server Password-Only Authenticated Key Exchange
Typical protocols for password-based authentication assume a single server which stores all the information (e.g., the password) necessary to authenticate a user. Unfortunately, a...
Jonathan Katz, Philip D. MacKenzie, Gelareh Taban,...
CSFW
2009
IEEE
14 years 2 months ago
Using ProVerif to Analyze Protocols with Diffie-Hellman Exponentiation
ProVerif is one of the most successful tools for cryptographic protocol analysis. However, dealing with algebraic properties of operators such as the exclusive OR (XOR) and Diffie-...
Ralf Küsters, Tomasz Truderung
EUROCRYPT
2005
Springer
14 years 3 months ago
Universally Composable Password-Based Key Exchange
Abstract. We propose and realize a definition of security for passwordbased key exchange within the framework of universally composable (UC) security, thus providing security guar...
Ran Canetti, Shai Halevi, Jonathan Katz, Yehuda Li...
IPPS
2007
IEEE
14 years 4 months ago
Pseudo Trust: Zero-Knowledge Based Authentication in Anonymous Peer-to-Peer Protocols
Most of the current trust models in peer-to-peer (P2P) systems are identity based, which means that in order for one peer to trust another, it needs to know the other peer’s ide...
Li Lu, Jinsong Han, Lei Hu, Jinpeng Huai, Yunhao L...