Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Series=LNCS AND Volume=5126

Als [bib] [pdf] [ps] [dvi] [xml] herunterladen.

Perpetuality for full and safe composition (in a constructive setting)
Delia Kesner
Lecture Notes in Computer Science 5126, 2008, pp. 311-322
A systemf with call-by-name exceptions
Sylvain Lebresne
Lecture Notes in Computer Science 5126, 2008, pp. 323-335
Linear logical algorithms
Robert J. Simmons, Frank Pfenning
Lecture Notes in Computer Science 5126, 2008, pp. 336-347
A simple model of separation logic for higher-order store
Lars Birkedal, Bernhard Reus, Jan Schwinghammer, Hongseok Yang
Lecture Notes in Computer Science 5126, 2008, pp. 348-360
Open implication
Karin Greimel, Roderick Bloem, Barbara Jobstmann, Moshe Vardi
Lecture Notes in Computer Science 5126, 2008, pp. 361-372
ATL* satisfiability is 2EXPTIME-complete
Sven Schewe
Lecture Notes in Computer Science 5126, 2008, pp. 373-385
Visibly pushdown transducers
Jean-François Raskin, Frédéric Servais
Lecture Notes in Computer Science 5126, 2008, pp. 386-397
The non-deterministic Mostowski hierarchy and distance-parity automata
Thomas Colcombet, Christof Löding
Lecture Notes in Computer Science 5126, 2008, pp. 398-409
Analyzing context-free grammars using an incremental SAT solver
Roland Axelsson, Keijo Heljanko, Martin Lange
Lecture Notes in Computer Science 5126, 2008, pp. 410-422
Weak pseudorandom functions in Minicrypt
Krzysztof Pietrzak, Johan Sjödin
Lecture Notes in Computer Science 5126, 2008, pp. 423-436
On black-box ring extraction and integer factorization
Kristina Altmann, Tibor Jager, Andy Rupp
Lecture Notes in Computer Science 5126, 2008, pp. 437-448
Extractable perfectly one-way functions
Ran Canetti, Ronny Ramzi Dakdouk
Lecture Notes in Computer Science 5126, 2008, pp. 449-460
Error-tolerant combiners for oblivious primitives
Bartosz Przydatek, Jürg Wullschleger
Lecture Notes in Computer Science 5126, 2008, pp. 461-472
Asynchronous multi-party computation with quadratic communication
Martin Hirt, Jesper Buus Nielsen, Bartosz Przydatek
Lecture Notes in Computer Science 5126, 2008, pp. 473-485
Improved garbled circuit: Free XOR gates and applications
Vladimir Kolesnikov, Thomas Schneider
Lecture Notes in Computer Science 5126, 2008, pp. 486-498
Improving the round complexity of VSS in point-to-point networks
Jonathan Katz, Chiu-Yuen Koo, Ranjit Kumaresan
Lecture Notes in Computer Science 5126, 2008, pp. 499-510
How to protect yourself without perfect shredding
Ran Canetti, Dror Eiger, Shafi Goldwasser, Dah-Yoh Lim
Lecture Notes in Computer Science 5126, 2008, pp. 511-523
Universally composable undeniable signature
Kaoru Kurosawa, Jun Furukawa
Lecture Notes in Computer Science 5126, 2008, pp. 524-535
Interactive PCP
Yael Tauman Kalai, Ran Raz
Lecture Notes in Computer Science 5126, 2008, pp. 536-547
Constant-round concurrent non-malleable zero knowledge in the bare public-key model
Rafail Ostrovsky, Giuseppe Persiano, Ivan Visconti
Lecture Notes in Computer Science 5126, 2008, pp. 548-559
Delegating capabilities in predicate encryption systems
Elaine Shi, Brent Waters
Lecture Notes in Computer Science 5126, 2008, pp. 560-578
Bounded ciphertext policy attribute based encryption
Vipul Goyal, Abhishek Jain, Omkant Pandey, Amit Sahai
Lecture Notes in Computer Science 5126, 2008, pp. 579-591
Making classical honest verifier zero knowledge protocols secure against quantum attacks
Sean Hallgren, Alexandra Kolla, Pranab Sen, Shengyu Zhang
Lecture Notes in Computer Science 5126, 2008, pp. 592-603
Composable security in the bounded-quantum-storage model
Stephanie Wehner, Jürg Wullschleger
Lecture Notes in Computer Science 5126, 2008, pp. 604-615
On the strength of the concatenated hash combiner when all the hash functions are weak
Jonathan J. Hoch, Adi Shamir
Lecture Notes in Computer Science 5126, 2008, pp. 616-630

Seiten < 1 2 3 >