30 search results - page 4 / 6 » Concurrently Secure Computation in Constant Rounds |
154
Voted
JOC
2008
15 years 5 months ago
2008
In the setting of concurrent self composition, a single protocol is executed many times concurrently by a single set of parties. In this paper, we prove lower bounds and impossibi...
126
click to vote
FOCS
2007
IEEE
15 years 12 months ago
2007
IEEE
Broadcast among n parties in the presence of t ≥ n/3 malicious parties is possible only with some additional setup. The most common setup considered is the existence of a PKI an...
142
Voted
ASIACRYPT
2000
Springer
15 years 10 months ago
2000
Springer
In this paper, we investigate the gap between auxiliary-input zero-knowledge (AIZK) and blackbox-simulation zero-knowledge (BSZK). It is an interesting open problem whether or not ...
163
click to vote
TCC
2009
Springer
16 years 6 months ago
2009
Springer
Abstract. In this paper we consider commitment schemes that are secure against concurrent man-in-the-middle (cMiM) attacks. Under such attacks, two possible notions of security for...
148
Voted
EUROCRYPT
2007
Springer
15 years 11 months ago
2007
Springer
Feistel Network, consisting of a repeated application of the Feistel Transform, gives a very convenient and popular method for designing “cryptographically strong” permutations...