Publications
- Armknecht, F., Chen, L., Sadeghi, A.-R. and Wachsmann, C. (2010). Anonymous authentication for RFID systems. In , Radio frequency identification: security and privacy issues : 6th International Workshop, RFIDSec 2010, Istanbul, Turkey, June 8 – 9, 2010; revised selected papers (S. 158–175). Lecture Notes in Computer Science, Springer: Berlin [u.a.].
- Armknecht, F., Elsner, C. and Schmidt, M. U. (2010). Using the inhomogeneous simultaneous approximation problem for cryptographic design.
Cryptology ePrint Archive, Report 2010/
302. Santa Barbara, CA: IACR, International Association for Cryptologic Research. - Armknecht, F., Katzenbeisser, S. and Peter, A. (2010). Group homomorphic encryption: characterizations, impossibility results, and applications : (früher under dem Titel: A cleaner view on IND-CCA1 secure homomorphic encryption using SOAP).
Cryptology ePrint Archive, Report 2010/
501. Santa Barbara, CA: IACR, International Association for Cryptologic Research. - Armknecht, F., Maes, R., Sadeghi, A.-R., Sunar, B. and Tuyls, P. (2010). Memory leakage-resilient encryption based on physically unclonable functions. In Towards hardware-intrinsic security : foundations and practice (S. 135–164). Berlin ; Heidelberg: Springer.
- Armknecht, F. and Sadeghi, A.-R. (2010). Physikalische Fingerabdrücke gegen Produkt-Piraterie. Forschen : Wissenschaftsmagazin, 2010, 42–45.
- Armknecht, F., Sadeghi, A.-R., Scafuro, A., Visconti, I. and Wachsmann, C. (2010). Impossibility results for RFID privacy notions. In Transactions on computational science 11 (S. 39–63). Berlin [u.a.]: Springer.
- Armknecht, F., Sadeghi, A.-R., Visconti, I. and Wachsmann, C. (2010). On RFID privacy with mutual authentication and tag corruption. In , Applied cryptography and network security : 8th International Conference, ACNS 2010, Beijing, China, June 22 – 25, 2010; proceedings (S. 493–510). Lecture Notes in Computer Science, Springer: Berlin [u.a.].
- Krause, M., Armknecht, F. and Fleischmann, E. (2010). Preimage resistance beyond the birthday bound: Double-length hashing revisited.
Cryptology ePrint Archive, Report 2010/
519. Santa Barbara, CA: IACR, International Association for Cryptologic Research. - Krause, M. and Wegener, I. (2010). Circuit complexity. In Boolean models and methods in mathematics, computer science, and engineering (S. 506–530). Cambridge [u.a.]: Cambridge University Press.
- Liu, Y., Ghosal, D., Armknecht, F., Sadeghi, A.-R., Schulz, S. and Katzenbeisser, S. (2010). Robust and undetectable steganographic timing channels for i.i.d. traffic. In , Information hiding : 12th International Conference, IH 2010, Calgary, AB, Canada, June 28 – 30, 2010; revised selected papers (S. 193–207). Lecture Notes in Computer Science, Springer: Berlin [u.a.].