Sciweavers

349 search results - page 46 / 70
» Compositional Security for Task-PIOAs
Sort
View
ASIACRYPT
2007
Springer
15 years 3 months ago
Secure Protocols with Asymmetric Trust
Abstract. In the standard general-adversary model for multi-party protocols, a global adversary structure is given, and every party must trust in this particular structure. We intr...
Ivan Damgård, Yvo Desmedt, Matthias Fitzi, J...
ICIP
2005
IEEE
15 years 11 months ago
Statistical restoration for robust and secure steganography
We investigate data hiding techniques that attempt to defeat steganalysis by restoring the statistics of the composite image to resemble that of the cover. The approach is to rese...
Kaushal Solanki, Kenneth Sullivan, Upamanyu Madhow...
84
Voted
PKC
2010
Springer
177views Cryptology» more  PKC 2010»
15 years 1 months ago
More Constructions of Lossy and Correlation-Secure Trapdoor Functions
We propose new and improved instantiations of lossy trapdoor functions (Peikert and Waters, STOC ’08), and correlation-secure trapdoor functions (Rosen and Segev, TCC ’09). Ou...
David Mandell Freeman, Oded Goldreich, Eike Kiltz,...
EUROCRYPT
2010
Springer
15 years 2 months ago
Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption
In this paper, we present two fully secure functional encryption schemes. Our first result is a fully secure attribute-based encryption (ABE) scheme. Previous constructions of AB...
Allison B. Lewko, Tatsuaki Okamoto, Amit Sahai, Ka...
CRYPTO
2007
Springer
162views Cryptology» more  CRYPTO 2007»
15 years 3 months ago
Universally-Composable Two-Party Computation in Two Rounds
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...
Omer Horvitz, Jonathan Katz