Markus Rückert

According to our database1, Markus Rückert authored at least 19 papers between 2008 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Design specifications for biomedical virtual twins in engineered adoptive cellular immunotherapies.
npj Digit. Medicine, 2025

2012
Fully Anonymous Attribute Tokens from Lattices.
Proceedings of the Security and Cryptography for Networks - 8th International Conference, 2012

2011
Lattice-based signature schemes with additional features.
PhD thesis, 2011

On the Security of the Winternitz One-Time Signature Scheme.
Proceedings of the Progress in Cryptology - AFRICACRYPT 2011, 2011

2010
Estimating the Security of Lattice-based Cryptosystems.
IACR Cryptol. ePrint Arch., 2010

Adaptively Secure Identity-Based Identification from Lattices without Random Oracles.
Proceedings of the Security and Cryptography for Networks, 7th International Conference, 2010

Improved Zero-Knowledge Identification with Lattices.
Proceedings of the Provable Security - 4th International Conference, 2010

Strongly Unforgeable Signatures and Hierarchical Identity-Based Signatures from Lattices without Random Oracles.
Proceedings of the Post-Quantum Cryptography, Third International Workshop, 2010

A Lattice-Based Threshold Ring Signature Scheme.
Proceedings of the Progress in Cryptology, 2010

Fair Partially Blind Signatures.
Proceedings of the Progress in Cryptology, 2010

Generic Constructions for Verifiably Encrypted Signatures without Random Oracles or NIZKs.
Proceedings of the Applied Cryptography and Network Security, 8th International Conference, 2010

2009
Security of Verifiably Encrypted Signatures.
IACR Cryptol. ePrint Arch., 2009

Post-quantum cryptography: lattice signatures.
Computing, 2009

Aggregate and Verifiably Encrypted Signatures from Multilinear Maps without Random Oracles.
Proceedings of the Advances in Information Security and Assurance, 2009

Security of Verifiably Encrypted Signatures and a Construction without Random Oracles.
Proceedings of the Pairing-Based Cryptography, 2009

Verifiably Encrypted Signatures from RSA without NIZKs.
Proceedings of the Progress in Cryptology, 2009

Lattice-based Blind Signatures.
Proceedings of the Algorithms and Number Theory, 24.05. - 29.05.2009, 2009

2008
Explicit hard instances of the shortest vector problem.
IACR Cryptol. ePrint Arch., 2008

Explicit Hard Instances of the Shortest Vector Problem.
Proceedings of the Post-Quantum Cryptography, Second International Workshop, 2008


  Loading...