Sciweavers

1274 search results - page 174 / 255
» New Proofs for
Sort
View
FUN
2010
Springer
293views Algorithms» more  FUN 2010»
14 years 2 months ago
Computational Complexity of Two-Dimensional Platform Games
Abstract. We analyze the computational complexity of various twodimensional platform games. We identify common properties of these games that allow us to state several meta-theorem...
Michal Forisek
CRYPTO
2007
Springer
106views Cryptology» more  CRYPTO 2007»
14 years 2 months ago
Indistinguishability Amplification
system is the abstraction of the input-output behavior of any kind of discrete system, in particular cryptographic systems. Many aspects of cryptographic security analyses and pro...
Ueli M. Maurer, Krzysztof Pietrzak, Renato Renner
COCO
2010
Springer
135views Algorithms» more  COCO 2010»
14 years 1 months ago
Lower Bounds for Testing Function Isomorphism
—We prove new lower bounds in the area of property testing of boolean functions. Specifically, we study the problem of testing whether a boolean function f is isomorphic to a ...
Eric Blais, Ryan O'Donnell
CCS
2001
ACM
14 years 1 months ago
A verifiable secret shuffle and its application to e-voting
We present a mathematical construct which provides a cryptographic protocol to verifiably shuffle a sequence of k modular integers, and discuss its application to secure, universa...
C. Andrew Neff
CTRSA
2010
Springer
191views Cryptology» more  CTRSA 2010»
14 years 1 months ago
Making the Diffie-Hellman Protocol Identity-Based
This paper presents a new identity based key agreement protocol. In id-based cryptography (introduced by Adi Shamir in [33]) each party uses its own identity as public key and rece...
Dario Fiore, Rosario Gennaro