4529 search results - page 213 / 906 » Position Based Cryptography |
160
click to vote
TCC
2010
Springer
16 years 3 months ago
2010
Springer
Abstract. For secure two-party and multi-party computation with abort, classification of which primitives are complete has been extensively studied in the literature. However, for...
169
click to vote
TCC
2010
Springer
16 years 1 months ago
2010
Springer
Introduced by Micali, Rabin and Kilian (MRK), the basic primitive of zero-knowledge sets (ZKS) allows a prover to commit to a secret set S so as to be able to prove statements such...
175
click to vote
ACNS
2008
Springer
16 years 25 days ago
2008
Springer
Peer-to-Peer (P2P) overlay networks are a flexible way of creating decentralized services. Although resilient to external Denial of Service attacks, overlay networks can be render...
186
click to vote
APPROX
2007
Springer
16 years 20 days ago
2007
Springer
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
165
click to vote
EUROCRYPT
2007
Springer
16 years 19 days 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...