Sciweavers

370 search results - page 30 / 74
» Limits of Constructive Security Proofs
Sort
View
IACR
2011
88views more  IACR 2011»
12 years 7 months ago
Targeted Malleability: Homomorphic Encryption for Restricted Computations
We put forward the notion of targeted malleability: given a homomorphic encryption scheme, in various scenarios we would like to restrict the homomorphic computations one can perf...
Dan Boneh, Gil Segev, Brent Waters
TCC
2009
Springer
131views Cryptology» more  TCC 2009»
14 years 8 months ago
Secure Computability of Functions in the IT Setting with Dishonest Majority and Applications to Long-Term Security
It is well known that general secure function evaluation (SFE) with information-theoretical (IT) security is infeasible in presence of a corrupted majority in the standard model. ...
Robin Künzler, Jörn Müller-Quade, D...
CRYPTO
2008
Springer
123views Cryptology» more  CRYPTO 2008»
13 years 10 months ago
Collusion-Free Protocols in the Mediated Model
Prior approaches [15, 14] to building collusion-free protocols require exotic channels. By taking a conceptually new approach, we are able to use a more digitally-friendly communic...
Joël Alwen, Abhi Shelat, Ivan Visconti
FCS
2006
13 years 9 months ago
Quantum Cryptographic Key Distribution Protocols
The application of the principles of quantum mechanics to cryptography has led to a respectable new dimension in confidential communication. As a result of these developments, it i...
Lelde Lace, Oksana Scegulnaja-Dubrovska, Ramuns Us...
ESOP
2009
Springer
14 years 2 months ago
Amortised Memory Analysis Using the Depth of Data Structures
Hofmann and Jost have presented a heap space analysis [1] that finds linear space bounds for many functional programs. It uses an amortised analysis: assigning hypothetical amount...
Brian Campbell