Sciweavers

954 search results - page 48 / 191
» On the Security of ''Golden'' Cryptography
Sort
View
TCC
2004
Springer
131views Cryptology» more  TCC 2004»
15 years 11 months ago
Rerandomizable and Replayable Adaptive Chosen Ciphertext Attack Secure Cryptosystems
Recently Canetti, Krawczyk and Nielsen defined the notion of replayable adaptive chosen ciphertext attack (RCCA) secure encryption. Essentially a cryptosystem that is RCCA secure ...
Jens Groth
GRC
2008
IEEE
15 years 7 months ago
Scalar-product based Secure Two-party Computation
—Secure multiparty computation is a very important research topic in cryptography. A secure multi-party computation involves N untrusful parties. It takes input xi from the ith p...
Chih-Hao Shen, Justin Zhan, Tsan-sheng Hsu, Churn-...
FC
2009
Springer
95views Cryptology» more  FC 2009»
16 years 22 days ago
Secure Multiparty Computation Goes Live
In this note, we report on the first large-scale and practical application of secure multiparty computation, which took place in January 2008. We also report on the novel cryptogr...
Peter Bogetoft, Dan Lund Christensen, Ivan Damg&ar...
ICB
2007
Springer
135views Biometrics» more  ICB 2007»
16 years 9 days ago
Feeling Is Believing: A Secure Template Exchange Protocol
We use grip pattern based biometrics as a secure side channel to achieve pre-authentication in a protocol that sets up a secure channel between two hand held devices. The protocol ...
Ileana Buhan, Jeroen Doumen, Pieter H. Hartel, Ray...
ACNS
2005
Springer
111views Cryptology» more  ACNS 2005»
15 years 11 months ago
Badger - A Fast and Provably Secure MAC
We present Badger, a new fast and provably secure MAC based on universal hashing. In the construction, a modified tree hash that is more efficient than standard tree hashing is us...
Martin Boesgaard, Thomas Christensen, Erik Zenner