Markus Rückert

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

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

2013
On the security of the Winternitz one-time signature scheme.
Int. J. Appl. Cryptogr., 2013

Aggregate and Verifiably Encrypted Signatures from Multilinear Maps Without Random Oracles.
IACR Cryptol. ePrint Arch., 2013

2012
Fully Anonymous Attribute Tokens from Lattices.
IACR Cryptol. ePrint Arch., 2012

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

2010
Generic Constructions for Verifiably Encrypted Signatures without Random Oracles or NIZKs.
IACR Cryptol. ePrint Arch., 2010

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

Strongly Unforgeable Signatures and Hierarchical Identity-based Signatures from Lattices without Random Oracles.
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

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

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

Post-quantum cryptography: lattice signatures.
Computing, 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

2008
Lattice-based Blind Signatures.
IACR Cryptol. ePrint Arch., 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...