Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=4052

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

Differential privacy
Cynthia Dwork
Lecture Notes in Computer Science 4052, 2006, pp. 1-12
The one way to quantum computation
Vincent Danos, Elham Kashefi, Prakash Panangaden
Lecture Notes in Computer Science 4052, 2006, pp. 13-21
Efficient zero knowledge on the Internet
Ivan Visconti
Lecture Notes in Computer Science 4052, 2006, pp. 22-33
Independent zero-knowledge sets
Rosario Gennaro, Silvio Micali
Lecture Notes in Computer Science 4052, 2006, pp. 34-45
An efficient compiler from \Sigma-protocol to 2-move deniable zero-knowledge
Jun Furukawa, Kaoru Kurosawa, Hideki Imai
Lecture Notes in Computer Science 4052, 2006, pp. 46-57
New extensions of pairing-based signatures into universal designated verifier signatures
Damien Vergnaud
Lecture Notes in Computer Science 4052, 2006, pp. 58-69
Corrupting one vs. corrupting many: The case of broadcast and multicast encryption
Daniele Micciancio, Saurabh Panjwani
Lecture Notes in Computer Science 4052, 2006, pp. 70-82
Cryptographically sound implementations for communicating processes
Pedro Adão, Cédric Fournet
Lecture Notes in Computer Science 4052, 2006, pp. 83-94
A Dolev-Yao-based definition of abuse-free protocols
Detlef Kähler, Ralf Küsters, Thomas Wilke
Lecture Notes in Computer Science 4052, 2006, pp. 95-106
Preserving secrecy under refinement
Rajeev Alur, Pavol C̑erný, Steve Zdancewic
Lecture Notes in Computer Science 4052, 2006, pp. 107-118
Quantifying information leakage in process calculi
Michele Boreale
Lecture Notes in Computer Science 4052, 2006, pp. 119-131
Symbolic protocol analysis in presence of a homomorphism operator and Exclusive Or
Stéphanie Delaune, Pascal Lafourcade, Denis Lugiez, Ralf Treinen
Lecture Notes in Computer Science 4052, 2006, pp. 132-143
Generalized compact knapsacks are collision resistant
Vadim Lyubashevsky, Daniele Micciancio
Lecture Notes in Computer Science 4052, 2006, pp. 144-155
An efficient provable distinguisher for HFE
Vivien Dubois, Louis Granboulan, Jacques Stern
Lecture Notes in Computer Science 4052, 2006, pp. 156-167
A tight bound for EMAC
Krzysztof Pietrzak
Lecture Notes in Computer Science 4052, 2006, pp. 168-179
Constructing single- and multi-output Boolean functions with maximal algebraic immunity
Frederik Armknecht, Matthias Krause
Lecture Notes in Computer Science 4052, 2006, pp. 180-191
On everlasting security in the hybrid bounded storage model
Danny Harnik, Moni Naor
Lecture Notes in Computer Science 4052, 2006, pp. 192-203
On the impossibility of extracting classical randomness using a quantum computer
Yevgeniy Dodis, Renato Renner
Lecture Notes in Computer Science 4052, 2006, pp. 204-215
Quantum hardcore functions by complexity-theoretical quantum list decoding
Akinori Kawachi, Tomoyuki Yamakami
Lecture Notes in Computer Science 4052, 2006, pp. 216-227
Efficient pseudorandom generators from exponentially hard one-way functions
Iftach Haitner, Danny Harnik, Omer Reingold
Lecture Notes in Computer Science 4052, 2006, pp. 228-239
Hardness of distinguishing the MSB or LSB of secret keys in Diffie-Hellman schemes
Pierre-Alain Fouque, David Pointcheval, Jacques Stern, Sébastien Zimmer
Lecture Notes in Computer Science 4052, 2006, pp. 240-251
A probabilistic Hoare-style logic for game-based cryptographic proofs
Ricardo Corin, Jerry den Hartog
Lecture Notes in Computer Science 4052, 2006, pp. 252-263
Generic construction of hybrid public key traitor tracing with full-public-traceability
Duong Hieu Phan, Reihaneh Safavi-Naini, Dongvu Tonien
Lecture Notes in Computer Science 4052, 2006, pp. 264-275
An adaptively secure mix-net without erasures
Douglas Wikström, Jens Groth
Lecture Notes in Computer Science 4052, 2006, pp. 276-287
Multipartite secret sharing by bivariate interpolation
Tamir Tassa, Nira Dyn
Lecture Notes in Computer Science 4052, 2006, pp. 288-299

Seiten 1 2 >