773 search results - page 28 / 155 » On Cryptographic Assumptions and Challenges |
CRYPTO
2006
Springer
14 years 1 months ago
2006
Springer
This paper presents the first automatic technique for proving not only protocols but also primitives in the exact security computational model. Automatic proofs of cryptographic pr...
ICISC
2008
13 years 11 months ago
2008
Oblivious transfer is one of the most important cryptographic primitives, both for theoretical and practical reasons and several protocols were proposed during the years. We provid...
TCC
2009
Springer
14 years 10 months ago
2009
Springer
It is well known that universally composable multiparty computation cannot, in general, be achieved in the standard model without setup assumptions when the adversary can corrupt a...
PKC
1999
Springer
14 years 1 months ago
1999
Springer
Public-key implementers often face strong hardware-related constraints. In particular, modular operations required in most cryptosystems generally constitute a computational bottle...
CORR
2006
Springer
13 years 9 months ago
2006
Springer
We consider a type of zero-knowledge protocols that are of interest for their practical applications within networks like the Internet: efficient zero-knowledge arguments of knowl...