The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ueli M. Maurer: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Daniel Bleichenbacher, Ueli M. Maurer
    On the Efficiency of One-Time Digital Signatures. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 1996, pp:145-158 [Conf]
  2. Matthias Fitzi, Martin Hirt, Ueli M. Maurer
    General Adversaries in Unconditional Multi-party Computation. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 1999, pp:232-246 [Conf]
  3. Martin Hirt, Ueli M. Maurer, Bartosz Przydatek
    Efficient Secure Multi-party Computation. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2000, pp:143-161 [Conf]
  4. Ueli M. Maurer, Stefan Wolf
    Towards Characterizing When Information-Theoretic Secret Key Agreement Is Possible. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 1996, pp:196-209 [Conf]
  5. Daniel Bleichenbacher, Ueli M. Maurer
    Directed Acyclic Graphs, One-way Functions and Digital Signatures. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1994, pp:75-82 [Conf]
  6. Christian Cachin, Ueli M. Maurer
    Unconditional Security Against Memory-Bounded Adversaries. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1997, pp:292-306 [Conf]
  7. Serge Fehr, Ueli M. Maurer
    Linear VSS and Distributed Commitments Based on Secret Sharing and Pairwise Checks. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2002, pp:565-580 [Conf]
  8. Matthias Fitzi, Juan A. Garay, Ueli M. Maurer, Rafail Ostrovsky
    Minimal Complete Primitives for Secure Multi-party Computation. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2001, pp:80-100 [Conf]
  9. Matthias Fitzi, Martin Hirt, Ueli M. Maurer
    Trading Correctness for Privacy in Unconditional Multi-Party Computation (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1998, pp:121-136 [Conf]
  10. Martin Hirt, Ueli M. Maurer
    Robustness for Free in Unconditional Multi-party Computation. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2001, pp:101-118 [Conf]
  11. Thomas Holenstein, Ueli M. Maurer, Johan Sjödin
    Complete Classification of Bilinear Hard-Core Functions. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2004, pp:73-91 [Conf]
  12. Kenji Koyama, Ueli M. Maurer, Tatsuaki Okamoto, Scott A. Vanstone
    New Public-Key Schemes Based on Elliptic Curves over the Ring Zn. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1991, pp:252-266 [Conf]
  13. Ueli M. Maurer
    A Universal Statistical Test for Random Bit Generators. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1990, pp:409-420 [Conf]
  14. Ueli M. Maurer
    Protocols for Secret Key Agreement by Public Discussion Based on Common Information. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1992, pp:461-470 [Conf]
  15. Ueli M. Maurer
    Towards the Equivalence of Breaking the Diffie-Hellman Protocol and Computing Discrete Algorithms [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1994, pp:271-281 [Conf]
  16. Ueli M. Maurer
    Information-Theoretic Cryptography. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1999, pp:47-64 [Conf]
  17. Ueli M. Maurer, James L. Massey
    Perfect Local Randomness in Pseudo-Random Sequences. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1989, pp:100-112 [Conf]
  18. Ueli M. Maurer, Stefan Wolf
    Diffie-Hellman Oracles. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1996, pp:268-282 [Conf]
  19. Ueli M. Maurer, Stefan Wolf
    Privacy Amplification Secure Against Active Adversaries. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1997, pp:307-321 [Conf]
  20. Ueli M. Maurer
    Cryptography 2000±10. [Citation Graph (0, 0)][DBLP]
    Informatics, 2001, pp:63-85 [Conf]
  21. Jan Camenisch, Ueli M. Maurer, Markus Stadler
    Digital Payment Systems with Passive Anonymity-Revoking Trustees. [Citation Graph (0, 0)][DBLP]
    ESORICS, 1996, pp:33-43 [Conf]
  22. Ueli M. Maurer
    Modelling a Public-Key Infrastructure. [Citation Graph (0, 0)][DBLP]
    ESORICS, 1996, pp:325-350 [Conf]
  23. Ueli M. Maurer, Pierre E. Schmid
    A Calculus for Secure Channel Establishment in Open Networks. [Citation Graph (0, 0)][DBLP]
    ESORICS, 1994, pp:175-192 [Conf]
  24. Christian Cachin, Ueli M. Maurer
    Linking Information Reconciliation and Privacy Amplification (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1994, pp:266-274 [Conf]
  25. Ronald Cramer, Ivan Damgård, Ueli M. Maurer
    General Secure Multi-party Computation from any Linear Secret-Sharing Scheme. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2000, pp:316-334 [Conf]
  26. Stefan Dziembowski, Ueli M. Maurer
    On Generating the Initial Key in the Bounded-Storage Model. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2004, pp:126-137 [Conf]
  27. Matthias Fitzi, Nicolas Gisin, Ueli M. Maurer, Oliver von Rotz
    Unconditional Byzantine Agreement and Multi-party Computation Secure against Dishonest Minorities from Scratch. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2002, pp:482-501 [Conf]
  28. James L. Massey, Ueli M. Maurer, Muzhong Wang
    Non-Expanding, Key-Minimal, Robustly-Perfect, Linear and Bilinear Ciphers. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1987, pp:237-247 [Conf]
  29. Ueli M. Maurer
    Indistinguishability of Random Systems. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2002, pp:110-132 [Conf]
  30. Ueli M. Maurer
    Fast Generation of Secure RSA-Moduli with Almost Maximal Diversity. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1989, pp:636-647 [Conf]
  31. Ueli M. Maurer
    A Provably-Secure Strongly-Randomized Cipher. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1990, pp:361-373 [Conf]
  32. Ueli M. Maurer
    New Approaches to the Design of Self-Synchronizing Stream Ciphers. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1991, pp:458-471 [Conf]
  33. Ueli M. Maurer
    A Simplified and Generalized Treatment of Luby-Rackoff Pseudorandom Permutation Generator. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1992, pp:239-255 [Conf]
  34. Ueli M. Maurer
    Factoring with an Oracle. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1992, pp:429-436 [Conf]
  35. Ueli M. Maurer
    Information-Theoretically Secure Secret-Key Agreement by NOT Authenticated Public Discussion. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1997, pp:209-225 [Conf]
  36. Ueli M. Maurer, Yvonne Anne Oswald, Krzysztof Pietrzak, Johan Sjödin
    Luby-Rackoff Ciphers from Weak Round Functions? [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2006, pp:391-408 [Conf]
  37. Ueli M. Maurer, Krzysztof Pietrzak
    The Security of Many-Round Luby-Rackoff Pseudo-Random Permutations. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2003, pp:544-561 [Conf]
  38. Ueli M. Maurer, Stefan Wolf
    Information-Theoretic Key Agreement: From Weak to Strong Secrecy for Free. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2000, pp:351-368 [Conf]
  39. Ueli M. Maurer, Stefan Wolf
    Lower Bounds on Generic Algorithms in Groups. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1998, pp:72-84 [Conf]
  40. Ueli M. Maurer, Yacov Yacobi
    Non-interactive Public-Key Cryptography. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1991, pp:498-507 [Conf]
  41. Ueli M. Maurer, Yacov Yacobi
    A Remark on a Non-interactive Public-Key Distribution System. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1992, pp:458-460 [Conf]
  42. Reto Kohlas, Ueli M. Maurer
    Reasoning about Public-Key Certification: On Bindings between Entities and Public Keys. [Citation Graph (0, 0)][DBLP]
    Financial Cryptography, 1999, pp:86-103 [Conf]
  43. Ueli M. Maurer
    Kryptographie: Basistechnologie der Informationsgesellschaft (Zusammenfassung). [Citation Graph (0, 0)][DBLP]
    GI Jahrestagung, 1999, pp:15- [Conf]
  44. Ueli M. Maurer, Johan Sjödin
    Single-Key AIL-MACs from Any FIL-MAC. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:472-484 [Conf]
  45. Robert König, Ueli M. Maurer
    Generalized Strong Extractors and Deterministic Privacy Amplification. [Citation Graph (0, 0)][DBLP]
    IMA Int. Conf., 2005, pp:322-339 [Conf]
  46. Ueli M. Maurer
    Abstract Models of Computation in Cryptography. [Citation Graph (0, 0)][DBLP]
    IMA Int. Conf., 2005, pp:1-12 [Conf]
  47. Ueli M. Maurer, Johan Sjödin
    Domain Expansion of MACs: Alternative Uses of the FIL-MAC. [Citation Graph (0, 0)][DBLP]
    IMA Int. Conf., 2005, pp:168-185 [Conf]
  48. Ueli M. Maurer
    Intrinsic Limitations of Digital Signatures and How to Cope with Them. [Citation Graph (0, 0)][DBLP]
    ISC, 2003, pp:180-192 [Conf]
  49. Reto Kohlas, Ueli M. Maurer
    Confidence Valuation in a Public-Key Infrastructure Based on Uncertain Evidence. [Citation Graph (0, 0)][DBLP]
    Public Key Cryptography, 2000, pp:93-112 [Conf]
  50. Endre Bangerter, Jan Camenisch, Ueli M. Maurer
    Efficient Proofs of Knowledge of Discrete Logarithms and Representations in Groups with Hidden Order. [Citation Graph (0, 0)][DBLP]
    Public Key Cryptography, 2005, pp:154-171 [Conf]
  51. Martin Hirt, Ueli M. Maurer
    Complete Characterization of Adversaries Tolerable in Secure Multi-Party Computation (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    PODC, 1997, pp:25-34 [Conf]
  52. Ueli M. Maurer
    Secure Multi-party Computation Made Simple. [Citation Graph (0, 0)][DBLP]
    SCN, 2002, pp:14-28 [Conf]
  53. Ueli M. Maurer
    The Role of Cryptography in Database Security. [Citation Graph (0, 0)][DBLP]
    SIGMOD Conference, 2004, pp:5-10 [Conf]
  54. Daniel Bleichenbacher, Ueli M. Maurer
    Optimal Tree-Based One-Time Digital Signature Schemes. [Citation Graph (0, 0)][DBLP]
    STACS, 1996, pp:363-374 [Conf]
  55. Ueli M. Maurer
    A Unified and Generalized Treatment of Authentification Theory. [Citation Graph (0, 0)][DBLP]
    STACS, 1996, pp:387-398 [Conf]
  56. Stefan Dziembowski, Ueli M. Maurer
    Tight security proofs for the bounded-storage model. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:341-350 [Conf]
  57. Matthias Fitzi, Ueli M. Maurer
    From partial consistency to global broadcast. [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:494-503 [Conf]
  58. Ueli M. Maurer
    Perfect Cryptographic Security from Partially Independent Channels [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:561-571 [Conf]
  59. Ueli M. Maurer, Krzysztof Pietrzak
    Composition of Random Systems: When Two Weak Make One Strong. [Citation Graph (0, 0)][DBLP]
    TCC, 2004, pp:410-427 [Conf]
  60. Ueli M. Maurer, Renato Renner, Clemens Holenstein
    Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle Methodology. [Citation Graph (0, 0)][DBLP]
    TCC, 2004, pp:21-39 [Conf]
  61. Bernd Altmann, Matthias Fitzi, Ueli M. Maurer
    Byzantine Agreement Secure against General Adversaries in the Dual Failure Model. [Citation Graph (0, 0)][DBLP]
    DISC, 1999, pp:123-137 [Conf]
  62. Matthias Fitzi, Ueli M. Maurer
    Efficient Byzantine Agreement Secure Against General Adversaries. [Citation Graph (0, 0)][DBLP]
    DISC, 1998, pp:134-148 [Conf]
  63. Ueli M. Maurer
    Towards a Theory of Consistency Primitives. [Citation Graph (0, 0)][DBLP]
    DISC, 2004, pp:379-389 [Conf]
  64. Ueli M. Maurer
    On the Oracle Complexity of Factoring Integers. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1995, v:5, n:3/4, pp:237-247 [Journal]
  65. Ueli M. Maurer
    Secure multi-party computation made simple. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:2, pp:370-381 [Journal]
  66. Ueli M. Maurer
    Asymptotically-Tight Bounds on the Number of Cycles in Generalized de Bruijn-Good Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1992, v:37, n:, pp:421-436 [Journal]
  67. Ueli M. Maurer, Stefan Wolf
    The Diffie-Hellman Protocol. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2000, v:19, n:2/3, pp:147-171 [Journal]
  68. Ueli M. Maurer, Yacov Yacobi
    A Non-interactive Public-Key Distribution System. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1996, v:9, n:3, pp:305-316 [Journal]
  69. Jan Camenisch, Ueli M. Maurer, Markus Stadler
    Digital Payment Systems With Passive Anonymity-Revoking Trustees. [Citation Graph (0, 0)][DBLP]
    Journal of Computer Security, 1997, v:5, n:1, pp:69-90 [Journal]
  70. Ueli M. Maurer, Pierre E. Schmid
    A Calculus for Security Bootstrapping in Distributed Systems. [Citation Graph (0, 0)][DBLP]
    Journal of Computer Security, 1996, v:4, n:1, pp:55-80 [Journal]
  71. Jeffrey Considine, Matthias Fitzi, Matthew K. Franklin, Leonid A. Levin, Ueli M. Maurer, David Metcalf
    Byzantine Agreement Given Partial Broadcast. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 2005, v:18, n:3, pp:191-217 [Journal]
  72. Stefan Dziembowski, Ueli M. Maurer
    Optimal Randomizer Efficiency in the Bounded-Storage Model. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 2004, v:17, n:1, pp:5-26 [Journal]
  73. Matthias Fitzi, Juan A. Garay, Ueli M. Maurer, Rafail Ostrovsky
    Minimal Complete Primitives for Secure Multi-Party Computation. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 2005, v:18, n:1, pp:37-61 [Journal]
  74. Christian Cachin, Ueli M. Maurer
    Linking Information Reconciliation and Privacy Amplification. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 1997, v:10, n:2, pp:97-110 [Journal]
  75. Martin Hirt, Ueli M. Maurer
    Player Simulation and General Adversary Structures in Perfect Multiparty Computation. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 2000, v:13, n:1, pp:31-60 [Journal]
  76. Ueli M. Maurer
    Conditionally-Perfect Secrecy and a Provably-Secure Randomized Cipher. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 1992, v:5, n:1, pp:53-66 [Journal]
  77. Ueli M. Maurer
    A Universal Statistical Test for Random Bit Generators. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 1992, v:5, n:2, pp:89-105 [Journal]
  78. Ueli M. Maurer
    Fast Generation of Prime Numbers and Secure Public-Key Cryptographic Parameters. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 1995, v:8, n:3, pp:123-155 [Journal]
  79. Ueli M. Maurer, James L. Massey
    Local Randomness in Pseudorandom Sequences. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 1991, v:4, n:2, pp:135-149 [Journal]
  80. Ueli M. Maurer, James L. Massey
    Cascade Ciphers: The Importance of Being First. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 1993, v:6, n:1, pp:55-61 [Journal]
  81. Ueli M. Maurer
    New Approaches to Digital Evidence. [Citation Graph (0, 0)][DBLP]
    Proceedings of the IEEE, 2004, v:92, n:6, pp:933-947 [Journal]
  82. Ueli M. Maurer, Stefan Wolf
    The Relationship Between Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:5, pp:1689-1721 [Journal]
  83. Charles H. Bennett, Gilles Brassard, Claude Crépeau, Ueli M. Maurer
    Generalized privacy amplification. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1995, v:41, n:6, pp:1915-1923 [Journal]
  84. Robert König, Ueli M. Maurer, Renato Renner
    On the power of quantum memory. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:7, pp:2391-2401 [Journal]
  85. Ueli M. Maurer
    Authentication theory and hypothesis testing. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:4, pp:1350-1356 [Journal]
  86. Ueli M. Maurer
    Secret key agreement by public discussion from common information. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:3, pp:733-742 [Journal]
  87. Ueli M. Maurer, Stefan Wolf
    Secret-key agreement over unauthenticated public channels I: Definitions and a completeness result. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2003, v:49, n:4, pp:822-831 [Journal]
  88. Ueli M. Maurer, Stefan Wolf
    Secret-key agreement over unauthenticated public channels II: the simulatability condition. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2003, v:49, n:4, pp:832-838 [Journal]
  89. Ueli M. Maurer, Stefan Wolf
    Secret-key agreement over unauthenticated public channels III: Privacy amplification. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2003, v:49, n:4, pp:839-851 [Journal]
  90. Ueli M. Maurer, Stefan Wolf
    Unconditionally Secure Key Agreement and the Intrinsic Conditional Information. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:2, pp:499-514 [Journal]
  91. Ueli M. Maurer, Dominik Raub
    Black-Box Extension Fields and the Inexistence of Field-Homomorphic One-Way Permutations. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2007, pp:427-443 [Conf]
  92. Ueli M. Maurer, Krzysztof Pietrzak, Renato Renner
    Indistinguishability Amplification. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2007, pp:130-149 [Conf]
  93. Ueli M. Maurer, Stefano Tessaro
    Domain Extension of Public Random Functions: Beyond the Birthday Barrier. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2007, pp:187-204 [Conf]
  94. Ueli M. Maurer, Johan Sjödin
    A Fast and Key-Efficient Reduction of Chosen-Ciphertext to Known-Plaintext Security. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2007, pp:498-516 [Conf]
  95. Robert König, Ueli Maurer, Stefano Tessaro
    Abstract Storage Devices [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  96. MPC vs. SFE : Unconditional and Computational Security. [Citation Graph (, )][DBLP]


  97. Basing PRFs on Constant-Query Weak PRFs: Minimizing Assumptions for Efficient Symmetric Cryptography. [Citation Graph (, )][DBLP]


  98. Cascade Encryption Revisited. [Citation Graph (, )][DBLP]


  99. Abstraction in Cryptography. [Citation Graph (, )][DBLP]


  100. Computational Indistinguishability Amplification: Tight Product Theorems for System Composition. [Citation Graph (, )][DBLP]


  101. 07381 Executive Summary - Cryptography. [Citation Graph (, )][DBLP]


  102. 07381 Abstracts Collection -- Cryptography. [Citation Graph (, )][DBLP]


  103. Breaking RSA Generically Is Equivalent to Factoring. [Citation Graph (, )][DBLP]


  104. Hybrid-secure MPC: trading information-theoretic robustness for computational privacy. [Citation Graph (, )][DBLP]


  105. Rethinking Digital Signatures. [Citation Graph (, )][DBLP]


  106. Abstract Storage Devices. [Citation Graph (, )][DBLP]


  107. MPC vs. SFE: Perfect Security in a Unified Corruption Model. [Citation Graph (, )][DBLP]


  108. Realistic Failures in Secure Multi-party Computation. [Citation Graph (, )][DBLP]


  109. A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch. [Citation Graph (, )][DBLP]


  110. Unifying Zero-Knowledge Proofs of Knowledge. [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.013secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002