Sciweavers

570 search results - page 4 / 114
» Black-box constructions for secure computation
Sort
View
TCC
2009
Springer
153views Cryptology» more  TCC 2009»
16 years 5 days ago
On the (Im)Possibility of Key Dependent Encryption
We study the possibility of constructing encryption schemes secure under messages that are chosen depending on the key k of the encryption scheme itself. We give the following sep...
Iftach Haitner, Thomas Holenstein
CRYPTO
2008
Springer
98views Cryptology» more  CRYPTO 2008»
15 years 1 months ago
One-Time Programs
Abstract. In this work, we introduce one-time programs, a new computational paradigm geared towards security applications. A one-time program can be executed on a single input, who...
Shafi Goldwasser, Yael Tauman Kalai, Guy N. Rothbl...
STOC
2010
ACM
227views Algorithms» more  STOC 2010»
15 years 4 months ago
On the Round Complexity of Covert Computation
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
Vipul Goyal and Abhishek Jain
EUROCRYPT
2005
Springer
15 years 5 months ago
On Robust Combiners for Oblivious Transfer and Other Primitives
A (1,2)-robust combiner for a cryptographic primitive P is a construction that takes two candidate schemes for P and combines them into one scheme that securely implement P even i...
Danny Harnik, Joe Kilian, Moni Naor, Omer Reingold...
88
Voted
ISW
2007
Springer
15 years 5 months ago
On the Concept of Software Obfuscation in Computer Security
Abstract. Program obfuscation is a semantic-preserving transformation aimed at bringing a program into such a form, which impedes the understanding of its algorithm and data struct...
Nikolay Kuzurin, Alexander Shokurov, Nikolay P. Va...