Sciweavers

49 search results - page 8 / 10
» Model-Based Testing of Cryptographic Protocols
Sort
View
CRYPTO
2008
Springer
186views Cryptology» more  CRYPTO 2008»
13 years 9 months ago
Communication Complexity in Algebraic Two-Party Protocols
In cryptography, there has been tremendous success in building various two-party protocols with small communication complexity out of homomorphic semantically-secure encryption sc...
Rafail Ostrovsky, William E. Skeith III
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...
ASIACRYPT
2009
Springer
14 years 2 months ago
Secure Two-Party Computation Is Practical
Abstract. Secure multi-party computation has been considered by the cryptographic community for a number of years. Until recently it has been a purely theoretical area, with few im...
Benny Pinkas, Thomas Schneider, Nigel P. Smart, St...
I3E
2001
196views Business» more  I3E 2001»
13 years 8 months ago
Security Modelling for Electronic Commerce: The Common Electronic Purse Specifications
: Designing security-critical systems correctly is very difficult. We present work on software engineering of security critical systems, supported by the CASE tool AUTOFOCUS. Secur...
Jan Jürjens, Guido Wimmel
EUROCRYPT
2006
Springer
13 years 11 months ago
Optimal Reductions Between Oblivious Transfers Using Interactive Hashing
Abstract. We present an asymptotically optimal reduction of one-outof-two String Oblivious Transfer to one-out-of-two Bit Oblivious Transfer using Interactive Hashing in conjunctio...
Claude Crépeau, George Savvides