Sciweavers

20 search results - page 2 / 4
» Universally Composable Symmetric Encryption
Sort
View
ACNS
2004
Springer
131views Cryptology» more  ACNS 2004»
13 years 8 months ago
Evaluating Security of Voting Schemes in the Universal Composability Framework
In the literature, voting protocols are considered secure if they satisfy requirements such as privacy, accuracy, robustness, etc. It can be time consuming to evaluate a voting pr...
Jens Groth
FSTTCS
2007
Springer
13 years 11 months ago
Safely Composing Security Protocols
Security protocols are small programs that are executed in hostile environments. Many results and tools have been developed to formally analyze the security of a protocol. However ...
Véronique Cortier, Jérémie De...
ASIACRYPT
2008
Springer
13 years 6 months ago
Towards Robust Computation on Encrypted Data
Encryption schemes that support computation on encrypted data are useful in constructing efficient and intuitively simple cryptographic protocols. However, the approach was previo...
Manoj Prabhakaran, Mike Rosulek
ITC
2003
IEEE
157views Hardware» more  ITC 2003»
13 years 10 months ago
Parity-Based Concurrent Error Detection in Symmetric Block Ciphers
Deliberate injection of faults into cryptographic devices is an effective cryptanalysis technique against symmetric and asymmetric encryption. We will describe a general concurren...
Ramesh Karri, Grigori Kuznetsov, Michael Göss...
FC
2005
Springer
142views Cryptology» more  FC 2005»
13 years 10 months ago
Testing Disjointness of Private Datasets
Two parties, say Alice and Bob, possess two sets of elements that belong to a universe of possible values and wish to test whether these sets are disjoint or not. In this paper we ...
Aggelos Kiayias, Antonina Mitrofanova