612 search results - page 54 / 123 » Hardness assumptions in the foundations of theoretical compu... |
APPROX
2007
Springer
14 years 2 months 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...
GI
2009
Springer
13 years 5 months ago
2009
Springer
: We explore the expressiveness of the BPMN workflow modelling language by applying it to MuCoMS, a paper submission system. This well known application domain is a suitable exampl...
SOFSEM
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. Constraint Handling Rules (CHR) is a general purpose, committedchoice declarative language which, differently from other similar languages, uses multi-headed (guarded) ru...
FOCS
2010
IEEE
13 years 5 months ago
2010
IEEE
A fundamental question in leakage-resilient cryptography is: can leakage resilience always be amplified by parallel repetition? It is natural to expect that if we have a leakage-r...
IFIPTCS
2010
13 years 5 months ago
2010
Abstract. In the field of Security, process equivalences have been used to characterize various information-hiding properties (for instance secrecy, anonymity and non-interference)...