165 search results - page 6 / 33 » Cryptographic Complexity Classes and Computational Intractab... |
ICCS
2007
Springer
15 years 3 months ago
2007
Springer
In this work we study the computational complexity of a class of grid Monte Carlo algorithms for integral equations. The idea of the algorithms consists in an approximation of the ...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Courcelle's famous theorem from 1990 states that any property of graphs definable in monadic second-order logic (MSO2) can be decided in linear time on any class of graphs of ...
FOCS
2002
IEEE
15 years 2 months ago
2002
IEEE
Randomization is vital in cryptography: secret keys should be randomly generated and most cryptographic primitives (e.g., encryption) must be probabilistic. As a bstraction, it is...
129
Voted
EUROCRYPT
1999
Springer
15 years 1 months ago
1999
Springer
Abstract. This paper investigates a novel computational problem, namely the Composite Residuosity Class Problem, and its applications to public-key cryptography. We propose a new t...
SAC
2009
ACM
2009
ACM
On the practical importance of communication complexity for secure multi-party computation protocols
15 years 4 months ago
Many advancements in the area of Secure Multi-Party Computation (SMC) protocols use improvements in communication complexity as a justification. We conducted an experimental stud...