117 search results - page 3 / 24 » Concurrent general composition of secure protocols in the ti... |
FOCS
2003
IEEE
13 years 11 months ago
2003
IEEE
We consider the problem of constructing a general protocol for secure two-party computation in a way that preserves security under concurrent composition. In our treatment, we foc...
TKDE
2002
13 years 6 months ago
2002
Database systems for real-time applications must satisfy timing constraints associated with transactions. Typically, a timing constraint is expressed in the form of a deadline and ...
CRYPTO
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. We show that only languages in BPP have public-coin, blackbox zero-knowledge protocols that are secure under an unbounded (polynomial) number of parallel repetitions. Thi...
CSFW
2005
IEEE
14 years 1 days ago
2005
IEEE
We present the first cryptographically sound Dolev-Yaostyle security proof of a comprehensive electronic payment system. The payment system is a slightly simplified variant of t...
CRYPTO
2000
Springer
13 years 10 months ago
2000
Springer
Secure Function Evaluation (SFE) protocols are very hard to design, and reducibility has been recognized as a highly desirable property of SFE protocols. Informally speaking, reduc...