Sciweavers

87 search results - page 10 / 18
» Two Generic Constructions of Probabilistic Cryptosystems and...
Sort
View
JOC
2007
133views more  JOC 2007»
13 years 7 months ago
Trapdoor Hard-to-Invert Group Isomorphisms and Their Application to Password-Based Authentication
In the security chain the weakest link is definitely the human one: human beings cannot remember long secrets and often resort to rather insecure solutions to keep track of their ...
Dario Catalano, David Pointcheval, Thomas Pornin
GPCE
2007
Springer
13 years 11 months ago
Library composition and adaptation using c++ concepts
Large scale software is composed of libraries produced by different entities. Non-intrusive and efficient mechanisms for adapting data structures from one library to conform to AP...
Jaakko Järvi, Matthew A. Marcus, Jacob N. Smi...
COCO
2010
Springer
186views Algorithms» more  COCO 2010»
13 years 10 months ago
Derandomized Parallel Repetition of Structured PCPs
A PCP is a proof system for NP in which the proof can be checked by a probabilistic verifier. The verifier is only allowed to read a very small portion of the proof, and in return ...
Irit Dinur, Or Meir
ECRTS
2006
IEEE
13 years 11 months ago
Efficient Synchronization under Global EDF Scheduling on Multiprocessors
We consider coordinating accesses to shared data structures in multiprocessor real-time systems scheduled under preemptive global EDF. To our knowledge, prior work on global EDF h...
UmaMaheswari C. Devi, Hennadiy Leontyev, James H. ...
STACS
2009
Springer
14 years 2 months ago
Strong Completeness of Coalgebraic Modal Logics
ABSTRACT. Canonical models are of central importance in modal logic, in particular as they witness strong completeness and hence compactness. While the canonical model construction...
Lutz Schröder, Dirk Pattinson