Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Shamir, Adi"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
RFID authentication efficient proactive information security with computational security
Shlomi Dolev
,
Marina Kopeetsky
,
Adi Shamir
Theory of Computing Systems
48
(1), 2011, pp. 132-149
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
Guaranteeing the diversity of number generators
Adi Shamir
,
Boaz Tsaban
Information and Computation
171
(2), 2001, pp. 350-363
Multiple noninteractive zero knowledge proofs under general assumptions
Uriel Feige
,
Dror Lapidot
,
Adi Shamir
SIAM Journal on Computing
29
(1), 1999, pp. 1-28
Fully parallelized multi-prover protocols for NEXP-time
Dror Lapidot
,
Adi Shamir
Journal of Computer and System Sciences
54
(2), 1997, pp. 215-220
A one-round, two-prover, zero-knowledge protocol for
NP
Dror Lapidot
,
Adi Shamir
Combinatorica
15
(2), 1995, pp. 203-214
Differential cryptanalysis of the data encryption standard
Eli Biham
,
Adi Shamir
Buch, 1993, pp. 188
On dice and coins: Models of computation for random generation
David Feldman
,
Russell Impagliazzo
,
Moni Naor
,
Noam Nisan
,
Steven Rudich
,
Adi Shamir
Information and Computation
104
(2), 1993, June, pp. 159-174
On the generation of multivariate polynomials which are hard to factor
Adi Shamir
Proceedings of the 25th Annual ACM Symposium on Theory of Computing, STOC'93 (San Diego, California, May 16--18, 1993)
, 1993, pp. 796-804
Multi-oracle interactive protocols with constant space verifiers
Uriel Feige
,
Adi Shamir
Journal of Computer and System Sciences
44
, 1992, pp. 259-271
Fully parallelized multi prover protocols for NEXP-time
Dror Lapidot
,
Adi Shamir
Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science, FOCS'91 (San Juan, Puerto Rico, October 1-4, 1991)
, 1991, pp. 13-18
IP=PSPACE
Adi Shamir
misc, 1989, December
Efficient Factoring Based on Partial Information
Ronald L. Rivest
,
Adi Shamir
Lecture Notes in Computer Science
219
, 1986, pp. 31-34
On the generation of cryptographically strong pseudo-random sequences
Adi Shamir
Lecture Notes in Computer Science
115
, 1981, pp. 544-550
The convergence of functions to fixedpoints of recursive definitions
Zohar Manna
,
Adi Shamir
Technical Report (STAN-CS-77-614), 1977, May
Finding minimum cutsets in reducible graphs
Adi Shamir
Technical Report (MIT/LCS/TM-85), 1977, June
Data types as objects
Adi Shamir
,
William Wadge
misc, pp. 465-479