10 search results - page 2 / 2 » Simulatable Security and Polynomially Bounded Concurrent Com... |
FOCS
2005
IEEE
13 years 11 months ago
2005
IEEE
We present a non-malleable commitment scheme that retains its security properties even when concurrently executed a polynomial number of times. That is, a manin-the-middle adversa...
CSFW
2007
IEEE
14 years 7 hour ago
2007
IEEE
Task-PIOA is a modeling framework for distributed systems with both probabilistic and nondeterministic behaviors. It is suitable for cryptographic applications because its task-bas...
CRYPTO
2009
Springer
14 years 7 days 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...
CRYPTO
2005
Springer
13 years 11 months ago
2005
Springer
We study the question whether the sequential or parallel composition of two functions, each indistinguishable from a random function by non-adaptive distinguishers is secure agains...
STOC
2010
ACM
13 years 10 months ago
2010
ACM
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...