Sciweavers

570 search results - page 2 / 114
» Black-box constructions for secure computation
Sort
View
ACISP
2009
Springer
13 years 9 months ago
Efficiency Bounds for Adversary Constructions in Black-Box Reductions
Abstract. We establish a framework for bounding the efficiency of cryptographic reductions in terms of their security transfer. While efficiency bounds for the reductions have been...
Ahto Buldas, Aivo Jürgenson, Margus Niitsoo
EUROCRYPT
2004
Springer
13 years 10 months ago
Black-Box Composition Does Not Imply Adaptive Security
In trying to provide formal evidence that composition has security increasing properties, we ask if the composition of non-adaptively secure permutation generators necessarily pro...
Steven Myers
TCC
2010
Springer
179views Cryptology» more  TCC 2010»
14 years 2 months ago
Two Is a Crowd? A Black-Box Separation of One-Wayness and Security under Correlated Inputs
A family of trapdoor functions is one-way under correlated inputs if no efficient adversary can invert it even when given the value of the function on multiple correlated inputs. T...
Yevgeniy Vahlis
CRYPTO
2005
Springer
135views Cryptology» more  CRYPTO 2005»
13 years 10 months ago
Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
We present a constant-round protocol for general secure multiparty computation which makes a black-box use of a pseudorandom generator. In particular, the protocol does not requir...
Ivan Damgård, Yuval Ishai
PKC
2009
Springer
131views Cryptology» more  PKC 2009»
14 years 5 months ago
Towards Black-Box Accountable Authority IBE with Short Ciphertexts and Private Keys
At Crypto'07, Goyal introduced the concept of Accountable Authority Identity-Based Encryption as a convenient tool to reduce the amount of trust in authorities in Identity-Bas...
Benoît Libert, Damien Vergnaud