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
[2]
Hilfe
Suche: Author="Kiayias, Aggelos"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Solving the at-most-once problem with nearly optimal effectiveness
Sotirios Kentros
,
Aggelos Kiayias
Theoretical Computer Science
496
, 2013, pp. 69-88
Secure function collection with sublinear storage
Maged H. Ibrahim
,
Aggelos Kiayias
,
Moti Yung
,
Hong-Sheng Zhou
Lecture Notes in Computer Science
5556
, 2009, pp. 534-545
At-most-once semantics in asynchronous shared memory
Sotirios Kentros
,
Aggelos Kiayias
,
Nicolas Nicolaou
,
Alexander A. Shvartsman
Proceedings of the 21st Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'2009 (Calgary, Alberta, Canada, August 11-13, 2009)
, 2009, pp. 43-44
Decoding interleaved Reed-Solomon codes over noisy channels
Daniel Bleichenbacher
,
Aggelos Kiayias
,
Moti Yung
Theoretical Computer Science
379
(3), 2007, pp. 348-360
Trading static for adaptive security in universally composable zero-knowledge
Aggelos Kiayias
,
Hong-Sheng Zhou
Lecture Notes in Computer Science
4596
, 2007, pp. 316-327
Asynchronous perfectly secure communication over one-time pads
Giovanni Di Crescenzo
,
Aggelos Kiayias
Lecture Notes in Computer Science
3580
, 2005, pp. 216-227
Decoding of interleaved reed Solomon codes over noisy data
Daniel Bleichenbacher
,
Aggelos Kiayias
,
Moti Yung
Lecture Notes in Computer Science
2719
, 2003, pp. 97-108
Cryptographic hardness based on the decoding of Reed-Solomon codes
Aggelos Kiayias
,
Moti Yung
Lecture Notes in Computer Science
2380
, 2002, pp. 232-243
Secure games with polynomial expressions
Aggelos Kiayias
,
Moti Yung
Lecture Notes in Computer Science
2076
, 2001, pp. 939-950