Sciweavers

38 search results - page 6 / 8
» Random Oracles and Auxiliary Input
Sort
View
ACNS
2004
Springer
131views Cryptology» more  ACNS 2004»
13 years 11 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
APPROX
2006
Springer
120views Algorithms» more  APPROX 2006»
13 years 11 months ago
Approximating Average Parameters of Graphs
Inspired by Feige (36th STOC, 2004), we initiate a study of sublinear randomized algorithms for approximating average parameters of a graph. Specifically, we consider the average ...
Oded Goldreich, Dana Ron
PKC
2010
Springer
187views Cryptology» more  PKC 2010»
13 years 9 months ago
Confidential Signatures and Deterministic Signcryption
Encrypt-and-sign, where one encrypts and signs a message in parallel, is usually not recommended for confidential message transmission. The reason is that the signature typically l...
Alexander W. Dent, Marc Fischlin, Mark Manulis, Ma...
CRYPTO
2010
Springer
189views Cryptology» more  CRYPTO 2010»
13 years 4 months ago
Instantiability of RSA-OAEP under Chosen-Plaintext Attack
We show that the widely deployed RSA-OAEP encryption scheme of Bellare and Rogaway (Eurocrypt 1994), which combines RSA with two rounds of an underlying Feistel network whose hash...
Eike Kiltz, Adam O'Neill, Adam Smith
ICFP
2010
ACM
13 years 8 months ago
Distance makes the types grow stronger: a calculus for differential privacy
We want assurances that sensitive information will not be disclosed when aggregate data derived from a database is published. Differential privacy offers a strong statistical guar...
Jason Reed, Benjamin C. Pierce