570 search results - page 47 / 114 » Black-box constructions for secure computation |
140
click to vote
CSFW
2012
IEEE
13 years 4 months ago
2012
IEEE
—In this paper, we propose a formal analysis of domain extenders for hash functions in the indifferentiability framework. We define a general model for domain extenders and prov...
130
click to vote
EUROCRYPT
2005
Springer
15 years 7 months ago
2005
Springer
We introduce a computational problem of distinguishing between two specific quantum states as a new cryptographic problem to design a quantum cryptographic scheme that is “secu...
121
click to vote
DCC
2011
IEEE
14 years 9 months ago
2011
IEEE
In this paper, we present a novel method for constructing a super-optimal pairing with great efficiency, which we call the omega pairing. The computation of the omega pairing requi...
108
click to vote
EUROCRYPT
2001
Springer
15 years 6 months ago
2001
Springer
In this paper we show how to convert a statistically binding but computationally concealing quantum bit commitment scheme into a computationally binding but statistically concealin...
121
click to vote
OOPSLA
2005
Springer
15 years 7 months ago
2005
Springer
We describe (and demonstrate) the execution model of a computing platform where computation is both incremental and data-driven. We call such an approach delta-driven. The platfor...