860 search results - page 26 / 172 » Completeness in two-party secure computation: a computationa... |
129
click to vote
ESORICS
2002
Springer
16 years 5 months ago
2002
Springer
A programmable secure coprocessor platform can help solve many security problems in distributed computing. However, these solutions usually require that coprocessor applications be...
185
click to vote
EUROCRYPT
2009
Springer
16 years 6 months ago
2009
Springer
We consider information-theoretic key agreement between two parties sharing somewhat different versions of a secret w that has relatively little entropy. Such key agreement, also ...
176
click to vote
IACR
2011
14 years 5 months ago
2011
We present new candidates for quantum-resistant public-key cryptosystems based on the conjectured difficulty of finding isogenies between supersingular elliptic curves. The main t...
133
click to vote
IJISEC
2002
15 years 5 months ago
2002
Using a random deal of cards to players and a computationally unlimited eavesdropper, all players wish to share a one-bit secret key which is informationtheoretically secure from t...
162
click to vote
TCS
2011
15 years 1 months ago
2011
A new complete characterization of β-strong normalization is given, both in the classical and in the lazy λ-calculus, through the notion of potential valuability inside two suit...