---
_id: '29763'
abstract:
- lang: eng
text: "Modern-day communication has become more and more digital. While this comes
with many advantages such as a more efficient economy, it has also created more
and more opportunities for various adversaries to manipulate communication or
eavesdrop on it. The Snowden revelations in 2013 further highlighted the seriousness
of these threats. To protect the communication of people, companies, and states
from such threats, we require cryptography with strong security guarantees.\r\nDifferent
applications may require different security properties from cryptographic schemes.
For most applications, however, so-called adaptive security is considered a reasonable
minimal requirement of security. Cryptographic schemes with adaptive security
remain secure in the presence of an adversary that can corrupt communication partners
to respond to messages of the adversaries choice, while the adversary may choose
the messages based on previously observed interactions.\r\nWhile cryptography
is associated the most with encryption, this is only one of many primitives that
are essential for the security of digital interactions. This thesis presents novel
identity-based encryption (IBE) schemes and verifiable random functions (VRFs)
that achieve adaptive security as outlined above. Moreover, the cryptographic
schemes presented in this thesis are proven secure in the standard model. That
is without making use of idealized models like the random oracle model."
author:
- first_name: David
full_name: Niehues, David
id: '36113'
last_name: Niehues
citation:
ama: Niehues D. More Efficient Techniques for Adaptively-Secure Cryptography.;
2022. doi:10.25926/rdtq-jw45
apa: Niehues, D. (2022). More Efficient Techniques for Adaptively-Secure Cryptography.
https://doi.org/10.25926/rdtq-jw45
bibtex: '@book{Niehues_2022, title={More Efficient Techniques for Adaptively-Secure
Cryptography}, DOI={10.25926/rdtq-jw45},
author={Niehues, David}, year={2022} }'
chicago: Niehues, David. More Efficient Techniques for Adaptively-Secure Cryptography,
2022. https://doi.org/10.25926/rdtq-jw45.
ieee: D. Niehues, More Efficient Techniques for Adaptively-Secure Cryptography.
2022.
mla: Niehues, David. More Efficient Techniques for Adaptively-Secure Cryptography.
2022, doi:10.25926/rdtq-jw45.
short: D. Niehues, More Efficient Techniques for Adaptively-Secure Cryptography,
2022.
date_created: 2022-02-07T13:29:07Z
date_updated: 2022-02-07T13:32:28Z
ddc:
- '000'
department:
- _id: '558'
doi: 10.25926/rdtq-jw45
file:
- access_level: closed
content_type: application/pdf
creator: davnie
date_created: 2022-02-07T13:26:05Z
date_updated: 2022-02-07T13:26:05Z
file_id: '29764'
file_name: de2107.pdf
file_size: 1542089
relation: main_file
success: 1
file_date_updated: 2022-02-07T13:26:05Z
has_accepted_license: '1'
keyword:
- public-key cryptography
- lattices
- pairings
- verifiable random functions
- identity-based encryption
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nd/4.0/
main_file_link:
- open_access: '1'
url: https://elpub.bib.uni-wuppertal.de/servlets/DerivateServlet/Derivate-14686/de2107.pdf
oa: '1'
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '13'
name: 'SFB 901 - C1: SFB 901 - Subproject C1'
publication_status: published
status: public
supervisor:
- first_name: Tibor
full_name: Jager, Tibor
id: '64669'
last_name: Jager
- first_name: Anja
full_name: Lehmann, Anja
last_name: Lehmann
title: More Efficient Techniques for Adaptively-Secure Cryptography
type: dissertation
user_id: '36113'
year: '2022'
...
---
_id: '2999'
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Stefanie
full_name: ' Naewe, Stefanie'
id: '1971'
last_name: ' Naewe'
citation:
ama: Blömer J, Naewe S. Sampling methods for shortest vectors, closest vectors
and successive minima. Theoretical Computer Science. 2009;410(18):1648-1665.
doi:10.1016/j.tcs.2008.12.045
apa: Blömer, J., & Naewe, S. (2009). Sampling methods for shortest vectors,
closest vectors and successive minima. Theoretical Computer Science, 410(18),
1648–1665. https://doi.org/10.1016/j.tcs.2008.12.045
bibtex: '@article{Blömer_ Naewe_2009, title={Sampling methods for shortest vectors,
closest vectors and successive minima}, volume={410}, DOI={10.1016/j.tcs.2008.12.045},
number={18}, journal={Theoretical Computer Science}, author={Blömer, Johannes
and Naewe, Stefanie}, year={2009}, pages={1648–1665} }'
chicago: 'Blömer, Johannes, and Stefanie Naewe. “Sampling Methods for Shortest
Vectors, Closest Vectors and Successive Minima.” Theoretical Computer Science
410, no. 18 (2009): 1648–65. https://doi.org/10.1016/j.tcs.2008.12.045.'
ieee: 'J. Blömer and S. Naewe, “Sampling methods for shortest vectors, closest
vectors and successive minima,” Theoretical Computer Science, vol. 410,
no. 18, pp. 1648–1665, 2009, doi: 10.1016/j.tcs.2008.12.045.'
mla: Blömer, Johannes, and Stefanie Naewe. “Sampling Methods for Shortest Vectors,
Closest Vectors and Successive Minima.” Theoretical Computer Science, vol.
410, no. 18, 2009, pp. 1648–65, doi:10.1016/j.tcs.2008.12.045.
short: J. Blömer, S. Naewe, Theoretical Computer Science 410 (2009) 1648–1665.
date_created: 2018-06-05T08:07:24Z
date_updated: 2024-08-08T12:18:04Z
department:
- _id: '64'
doi: 10.1016/j.tcs.2008.12.045
intvolume: ' 410'
issue: '18'
keyword:
- Geometry of numbers
- Lattices
- Shortest vectors
language:
- iso: eng
page: 1648 - 1665
publication: Theoretical Computer Science
publication_identifier:
issn:
- 0304-3975
publication_status: published
status: public
title: Sampling methods for shortest vectors, closest vectors and successive minima
type: journal_article
user_id: '49063'
volume: 410
year: '2009'
...