---
_id: '2969'
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Sascha
full_name: Brauer, Sascha
id: '13291'
last_name: Brauer
- first_name: Kathrin
full_name: Bujna, Kathrin
last_name: Bujna
citation:
ama: Blömer J, Brauer S, Bujna K. Hard-Clustering with Gaussian Mixture Models.
2016.
apa: Blömer, J., Brauer, S., & Bujna, K. (2016). Hard-Clustering with Gaussian
Mixture Models. Computing Research Repository.
bibtex: '@article{Blömer_Brauer_Bujna_2016, title={Hard-Clustering with Gaussian
Mixture Models}, publisher={Computing Research Repository}, author={Blömer, Johannes
and Brauer, Sascha and Bujna, Kathrin}, year={2016} }'
chicago: Blömer, Johannes, Sascha Brauer, and Kathrin Bujna. “Hard-Clustering with
Gaussian Mixture Models.” Computing Research Repository, 2016.
ieee: J. Blömer, S. Brauer, and K. Bujna, “Hard-Clustering with Gaussian Mixture
Models.” Computing Research Repository, 2016.
mla: Blömer, Johannes, et al. Hard-Clustering with Gaussian Mixture Models.
Computing Research Repository, 2016.
short: J. Blömer, S. Brauer, K. Bujna, (2016).
date_created: 2018-06-04T12:26:51Z
date_updated: 2022-01-06T06:58:49Z
department:
- _id: '64'
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1603.06478
oa: '1'
publisher: Computing Research Repository
status: public
title: Hard-Clustering with Gaussian Mixture Models
type: preprint
user_id: '25078'
year: '2016'
...
---
_id: '2970'
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Kathrin
full_name: Bujna, Kathrin
last_name: Bujna
citation:
ama: 'Blömer J, Bujna K. Adaptive Seeding for Gaussian Mixture Models. In: Advances
in Knowledge Discovery and Data Mining. Cham: Springer International Publishing;
2016:296-308. doi:10.1007/978-3-319-31750-2_24'
apa: 'Blömer, J., & Bujna, K. (2016). Adaptive Seeding for Gaussian Mixture
Models. In Advances in Knowledge Discovery and Data Mining (pp. 296–308).
Cham: Springer International Publishing. https://doi.org/10.1007/978-3-319-31750-2_24'
bibtex: '@inbook{Blömer_Bujna_2016, place={Cham}, title={Adaptive Seeding for Gaussian
Mixture Models}, DOI={10.1007/978-3-319-31750-2_24},
booktitle={Advances in Knowledge Discovery and Data Mining}, publisher={Springer
International Publishing}, author={Blömer, Johannes and Bujna, Kathrin}, year={2016},
pages={296–308} }'
chicago: 'Blömer, Johannes, and Kathrin Bujna. “Adaptive Seeding for Gaussian Mixture
Models.” In Advances in Knowledge Discovery and Data Mining, 296–308. Cham:
Springer International Publishing, 2016. https://doi.org/10.1007/978-3-319-31750-2_24.'
ieee: 'J. Blömer and K. Bujna, “Adaptive Seeding for Gaussian Mixture Models,” in
Advances in Knowledge Discovery and Data Mining, Cham: Springer International
Publishing, 2016, pp. 296–308.'
mla: Blömer, Johannes, and Kathrin Bujna. “Adaptive Seeding for Gaussian Mixture
Models.” Advances in Knowledge Discovery and Data Mining, Springer International
Publishing, 2016, pp. 296–308, doi:10.1007/978-3-319-31750-2_24.
short: 'J. Blömer, K. Bujna, in: Advances in Knowledge Discovery and Data Mining,
Springer International Publishing, Cham, 2016, pp. 296–308.'
date_created: 2018-06-04T12:27:21Z
date_updated: 2022-01-06T06:58:49Z
department:
- _id: '64'
doi: 10.1007/978-3-319-31750-2_24
page: 296-308
place: Cham
publication: Advances in Knowledge Discovery and Data Mining
publication_identifier:
isbn:
- '9783319317496'
- '9783319317502'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
status: public
title: Adaptive Seeding for Gaussian Mixture Models
type: book_chapter
user_id: '25078'
year: '2016'
...
---
_id: '2971'
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Peter
full_name: Günther, Peter
last_name: Günther
citation:
ama: Blömer J, Günther P. Effizienz Und Sicherheit Paarungsbasierter Kryptographie.
Tagungsband des 26. Fraunhofer SIT Smartcard-Workshops; 2016.
apa: Blömer, J., & Günther, P. (2016). Effizienz und Sicherheit paarungsbasierter
Kryptographie. Tagungsband des 26. Fraunhofer SIT Smartcard-Workshops.
bibtex: '@book{Blömer_Günther_2016, title={Effizienz und Sicherheit paarungsbasierter
Kryptographie}, publisher={Tagungsband des 26. Fraunhofer SIT Smartcard-Workshops},
author={Blömer, Johannes and Günther, Peter}, year={2016} }'
chicago: Blömer, Johannes, and Peter Günther. Effizienz Und Sicherheit Paarungsbasierter
Kryptographie. Tagungsband des 26. Fraunhofer SIT Smartcard-Workshops, 2016.
ieee: J. Blömer and P. Günther, Effizienz und Sicherheit paarungsbasierter Kryptographie.
Tagungsband des 26. Fraunhofer SIT Smartcard-Workshops, 2016.
mla: Blömer, Johannes, and Peter Günther. Effizienz Und Sicherheit Paarungsbasierter
Kryptographie. Tagungsband des 26. Fraunhofer SIT Smartcard-Workshops, 2016.
short: J. Blömer, P. Günther, Effizienz Und Sicherheit Paarungsbasierter Kryptographie,
Tagungsband des 26. Fraunhofer SIT Smartcard-Workshops, 2016.
date_created: 2018-06-05T07:21:25Z
date_updated: 2022-01-06T06:58:49Z
department:
- _id: '64'
publication_status: published
publisher: Tagungsband des 26. Fraunhofer SIT Smartcard-Workshops
status: public
title: Effizienz und Sicherheit paarungsbasierter Kryptographie
type: report
user_id: '25078'
year: '2016'
...
---
_id: '3112'
author:
- first_name: Dennis
full_name: Hofheinz, Dennis
last_name: Hofheinz
- first_name: Tibor
full_name: Jager, Tibor
id: '64669'
last_name: Jager
citation:
ama: Hofheinz D, Jager T. Tightly secure signatures and public-key encryption. Des
Codes Cryptography. 2016;(1):29--61. doi:10.1007/s10623-015-0062-x
apa: Hofheinz, D., & Jager, T. (2016). Tightly secure signatures and public-key
encryption. Des. Codes Cryptography, (1), 29--61. https://doi.org/10.1007/s10623-015-0062-x
bibtex: '@article{Hofheinz_Jager_2016, title={Tightly secure signatures and public-key
encryption}, DOI={10.1007/s10623-015-0062-x},
number={1}, journal={Des. Codes Cryptography}, author={Hofheinz, Dennis and Jager,
Tibor}, year={2016}, pages={29--61} }'
chicago: 'Hofheinz, Dennis, and Tibor Jager. “Tightly Secure Signatures and Public-Key
Encryption.” Des. Codes Cryptography, no. 1 (2016): 29--61. https://doi.org/10.1007/s10623-015-0062-x.'
ieee: D. Hofheinz and T. Jager, “Tightly secure signatures and public-key encryption,”
Des. Codes Cryptography, no. 1, pp. 29--61, 2016.
mla: Hofheinz, Dennis, and Tibor Jager. “Tightly Secure Signatures and Public-Key
Encryption.” Des. Codes Cryptography, no. 1, 2016, pp. 29--61, doi:10.1007/s10623-015-0062-x.
short: D. Hofheinz, T. Jager, Des. Codes Cryptography (2016) 29--61.
date_created: 2018-06-07T09:12:15Z
date_updated: 2022-01-06T06:58:56Z
department:
- _id: '558'
doi: 10.1007/s10623-015-0062-x
extern: '1'
issue: '1'
page: 29--61
publication: Des. Codes Cryptography
status: public
title: Tightly secure signatures and public-key encryption
type: journal_article
user_id: '38235'
year: '2016'
...
---
_id: '3113'
author:
- first_name: Felix
full_name: Heuer, Felix
last_name: Heuer
- first_name: Tibor
full_name: Jager, Tibor
id: '64669'
last_name: Jager
- first_name: Sven
full_name: Schäge, Sven
last_name: Schäge
- first_name: Eike
full_name: Kiltz, Eike
last_name: Kiltz
citation:
ama: Heuer F, Jager T, Schäge S, Kiltz E. Selective opening security of practical
public-key encryption schemes. IET Information Security. 2016;(6):304--318.
doi:10.1049/iet-ifs.2015.0507
apa: Heuer, F., Jager, T., Schäge, S., & Kiltz, E. (2016). Selective opening
security of practical public-key encryption schemes. IET Information Security,
(6), 304--318. https://doi.org/10.1049/iet-ifs.2015.0507
bibtex: '@article{Heuer_Jager_Schäge_Kiltz_2016, title={Selective opening security
of practical public-key encryption schemes}, DOI={10.1049/iet-ifs.2015.0507},
number={6}, journal={IET Information Security}, author={Heuer, Felix and Jager,
Tibor and Schäge, Sven and Kiltz, Eike}, year={2016}, pages={304--318} }'
chicago: 'Heuer, Felix, Tibor Jager, Sven Schäge, and Eike Kiltz. “Selective Opening
Security of Practical Public-Key Encryption Schemes.” IET Information Security,
no. 6 (2016): 304--318. https://doi.org/10.1049/iet-ifs.2015.0507.'
ieee: F. Heuer, T. Jager, S. Schäge, and E. Kiltz, “Selective opening security of
practical public-key encryption schemes,” IET Information Security, no.
6, pp. 304--318, 2016.
mla: Heuer, Felix, et al. “Selective Opening Security of Practical Public-Key Encryption
Schemes.” IET Information Security, no. 6, 2016, pp. 304--318, doi:10.1049/iet-ifs.2015.0507.
short: F. Heuer, T. Jager, S. Schäge, E. Kiltz, IET Information Security (2016)
304--318.
date_created: 2018-06-07T09:12:50Z
date_updated: 2022-01-06T06:58:56Z
department:
- _id: '558'
doi: 10.1049/iet-ifs.2015.0507
extern: '1'
issue: '6'
page: 304--318
publication: IET Information Security
status: public
title: Selective opening security of practical public-key encryption schemes
type: journal_article
user_id: '38235'
year: '2016'
...
---
_id: '3114'
author:
- first_name: Tibor
full_name: Jager, Tibor
id: '64669'
last_name: Jager
- first_name: Andy
full_name: Rupp, Andy
last_name: Rupp
citation:
ama: 'Jager T, Rupp A. Black-Box Accumulation: Collecting Incentives in a Privacy-Preserving
Way. PoPETs. 2016;(3):62--82.'
apa: 'Jager, T., & Rupp, A. (2016). Black-Box Accumulation: Collecting Incentives
in a Privacy-Preserving Way. PoPETs, (3), 62--82.'
bibtex: '@article{Jager_Rupp_2016, title={Black-Box Accumulation: Collecting Incentives
in a Privacy-Preserving Way}, number={3}, journal={PoPETs}, author={Jager, Tibor
and Rupp, Andy}, year={2016}, pages={62--82} }'
chicago: 'Jager, Tibor, and Andy Rupp. “Black-Box Accumulation: Collecting Incentives
in a Privacy-Preserving Way.” PoPETs, no. 3 (2016): 62--82.'
ieee: 'T. Jager and A. Rupp, “Black-Box Accumulation: Collecting Incentives in a
Privacy-Preserving Way,” PoPETs, no. 3, pp. 62--82, 2016.'
mla: 'Jager, Tibor, and Andy Rupp. “Black-Box Accumulation: Collecting Incentives
in a Privacy-Preserving Way.” PoPETs, no. 3, 2016, pp. 62--82.'
short: T. Jager, A. Rupp, PoPETs (2016) 62--82.
date_created: 2018-06-07T09:13:15Z
date_updated: 2022-01-06T06:58:56Z
department:
- _id: '558'
extern: '1'
issue: '3'
page: 62--82
publication: PoPETs
status: public
title: 'Black-Box Accumulation: Collecting Incentives in a Privacy-Preserving Way'
type: journal_article
user_id: '38235'
year: '2016'
...
---
_id: '3115'
author:
- first_name: Dennis
full_name: Hofheinz, Dennis
last_name: Hofheinz
- first_name: Tibor
full_name: Jager, Tibor
id: '64669'
last_name: Jager
- first_name: Dakshita
full_name: Khurana, Dakshita
last_name: Khurana
- first_name: Amit
full_name: Sahai, Amit
last_name: Sahai
- first_name: Brent
full_name: Waters, Brent
last_name: Waters
- first_name: Mark
full_name: Zhandry, Mark
last_name: Zhandry
citation:
ama: 'Hofheinz D, Jager T, Khurana D, Sahai A, Waters B, Zhandry M. How to Generate
and Use Universal Samplers. In: Advances in Cryptology - ASIACRYPT 2016 - 22nd
International Conference on the Theory and Application of Cryptology and Information
Security, Hanoi, Vietnam, December 4-8, 2016, Proceedings, Part II. ; 2016:715--744.
doi:10.1007/978-3-662-53890-6_24'
apa: Hofheinz, D., Jager, T., Khurana, D., Sahai, A., Waters, B., & Zhandry,
M. (2016). How to Generate and Use Universal Samplers. In Advances in Cryptology
- ASIACRYPT 2016 - 22nd International Conference on the Theory and Application
of Cryptology and Information Security, Hanoi, Vietnam, December 4-8, 2016, Proceedings,
Part II (pp. 715--744). https://doi.org/10.1007/978-3-662-53890-6_24
bibtex: '@inproceedings{Hofheinz_Jager_Khurana_Sahai_Waters_Zhandry_2016, title={How
to Generate and Use Universal Samplers}, DOI={10.1007/978-3-662-53890-6_24},
booktitle={Advances in Cryptology - ASIACRYPT 2016 - 22nd International Conference
on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam,
December 4-8, 2016, Proceedings, Part II}, author={Hofheinz, Dennis and Jager,
Tibor and Khurana, Dakshita and Sahai, Amit and Waters, Brent and Zhandry, Mark},
year={2016}, pages={715--744} }'
chicago: Hofheinz, Dennis, Tibor Jager, Dakshita Khurana, Amit Sahai, Brent Waters,
and Mark Zhandry. “How to Generate and Use Universal Samplers.” In Advances
in Cryptology - ASIACRYPT 2016 - 22nd International Conference on the Theory and
Application of Cryptology and Information Security, Hanoi, Vietnam, December 4-8,
2016, Proceedings, Part II, 715--744, 2016. https://doi.org/10.1007/978-3-662-53890-6_24.
ieee: D. Hofheinz, T. Jager, D. Khurana, A. Sahai, B. Waters, and M. Zhandry, “How
to Generate and Use Universal Samplers,” in Advances in Cryptology - ASIACRYPT
2016 - 22nd International Conference on the Theory and Application of Cryptology
and Information Security, Hanoi, Vietnam, December 4-8, 2016, Proceedings, Part
II, 2016, pp. 715--744.
mla: Hofheinz, Dennis, et al. “How to Generate and Use Universal Samplers.” Advances
in Cryptology - ASIACRYPT 2016 - 22nd International Conference on the Theory and
Application of Cryptology and Information Security, Hanoi, Vietnam, December 4-8,
2016, Proceedings, Part II, 2016, pp. 715--744, doi:10.1007/978-3-662-53890-6_24.
short: 'D. Hofheinz, T. Jager, D. Khurana, A. Sahai, B. Waters, M. Zhandry, in:
Advances in Cryptology - ASIACRYPT 2016 - 22nd International Conference on the
Theory and Application of Cryptology and Information Security, Hanoi, Vietnam,
December 4-8, 2016, Proceedings, Part II, 2016, pp. 715--744.'
date_created: 2018-06-07T09:13:48Z
date_updated: 2022-01-06T06:58:57Z
department:
- _id: '558'
doi: 10.1007/978-3-662-53890-6_24
extern: '1'
page: 715--744
publication: Advances in Cryptology - ASIACRYPT 2016 - 22nd International Conference
on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam,
December 4-8, 2016, Proceedings, Part II
status: public
title: How to Generate and Use Universal Samplers
type: conference
user_id: '38235'
year: '2016'
...
---
_id: '3116'
author:
- first_name: Matthias
full_name: Horst, Matthias
last_name: Horst
- first_name: Martin
full_name: Grothe, Martin
last_name: Grothe
- first_name: Tibor
full_name: Jager, Tibor
id: '64669'
last_name: Jager
- first_name: Jörg
full_name: Schwenk, Jörg
last_name: Schwenk
citation:
ama: 'Horst M, Grothe M, Jager T, Schwenk J. Breaking PPTP VPNs via RADIUS Encryption.
In: Cryptology and Network Security - 15th International Conference, CANS 2016,
Milan, Italy, November 14-16, 2016, Proceedings. ; 2016:159--175. doi:10.1007/978-3-319-48965-0_10'
apa: Horst, M., Grothe, M., Jager, T., & Schwenk, J. (2016). Breaking PPTP VPNs
via RADIUS Encryption. In Cryptology and Network Security - 15th International
Conference, CANS 2016, Milan, Italy, November 14-16, 2016, Proceedings (pp.
159--175). https://doi.org/10.1007/978-3-319-48965-0_10
bibtex: '@inproceedings{Horst_Grothe_Jager_Schwenk_2016, title={Breaking PPTP VPNs
via RADIUS Encryption}, DOI={10.1007/978-3-319-48965-0_10},
booktitle={Cryptology and Network Security - 15th International Conference, CANS
2016, Milan, Italy, November 14-16, 2016, Proceedings}, author={Horst, Matthias
and Grothe, Martin and Jager, Tibor and Schwenk, Jörg}, year={2016}, pages={159--175}
}'
chicago: Horst, Matthias, Martin Grothe, Tibor Jager, and Jörg Schwenk. “Breaking
PPTP VPNs via RADIUS Encryption.” In Cryptology and Network Security - 15th
International Conference, CANS 2016, Milan, Italy, November 14-16, 2016, Proceedings,
159--175, 2016. https://doi.org/10.1007/978-3-319-48965-0_10.
ieee: M. Horst, M. Grothe, T. Jager, and J. Schwenk, “Breaking PPTP VPNs via RADIUS
Encryption,” in Cryptology and Network Security - 15th International Conference,
CANS 2016, Milan, Italy, November 14-16, 2016, Proceedings, 2016, pp. 159--175.
mla: Horst, Matthias, et al. “Breaking PPTP VPNs via RADIUS Encryption.” Cryptology
and Network Security - 15th International Conference, CANS 2016, Milan, Italy,
November 14-16, 2016, Proceedings, 2016, pp. 159--175, doi:10.1007/978-3-319-48965-0_10.
short: 'M. Horst, M. Grothe, T. Jager, J. Schwenk, in: Cryptology and Network Security
- 15th International Conference, CANS 2016, Milan, Italy, November 14-16, 2016,
Proceedings, 2016, pp. 159--175.'
date_created: 2018-06-07T09:14:34Z
date_updated: 2022-01-06T06:58:57Z
department:
- _id: '558'
doi: 10.1007/978-3-319-48965-0_10
extern: '1'
page: 159--175
publication: Cryptology and Network Security - 15th International Conference, CANS
2016, Milan, Italy, November 14-16, 2016, Proceedings
status: public
title: Breaking PPTP VPNs via RADIUS Encryption
type: conference
user_id: '38235'
year: '2016'
...
---
_id: '3117'
author:
- first_name: Christoph
full_name: Bader, Christoph
last_name: Bader
- first_name: Tibor
full_name: Jager, Tibor
id: '64669'
last_name: Jager
- first_name: Yong
full_name: Li, Yong
last_name: Li
- first_name: Sven
full_name: Schäge, Sven
last_name: Schäge
citation:
ama: 'Bader C, Jager T, Li Y, Schäge S. On the Impossibility of Tight Cryptographic
Reductions. In: Advances in Cryptology - EUROCRYPT 2016 - 35th Annual International
Conference on the Theory and Applications of Cryptographic Techniques, Vienna,
Austria, May 8-12, 2016, Proceedings, Part II. ; 2016:273--304. doi:10.1007/978-3-662-49896-5_10'
apa: Bader, C., Jager, T., Li, Y., & Schäge, S. (2016). On the Impossibility
of Tight Cryptographic Reductions. In Advances in Cryptology - EUROCRYPT 2016
- 35th Annual International Conference on the Theory and Applications of Cryptographic
Techniques, Vienna, Austria, May 8-12, 2016, Proceedings, Part II (pp. 273--304).
https://doi.org/10.1007/978-3-662-49896-5_10
bibtex: '@inproceedings{Bader_Jager_Li_Schäge_2016, title={On the Impossibility
of Tight Cryptographic Reductions}, DOI={10.1007/978-3-662-49896-5_10},
booktitle={Advances in Cryptology - EUROCRYPT 2016 - 35th Annual International
Conference on the Theory and Applications of Cryptographic Techniques, Vienna,
Austria, May 8-12, 2016, Proceedings, Part II}, author={Bader, Christoph and Jager,
Tibor and Li, Yong and Schäge, Sven}, year={2016}, pages={273--304} }'
chicago: Bader, Christoph, Tibor Jager, Yong Li, and Sven Schäge. “On the Impossibility
of Tight Cryptographic Reductions.” In Advances in Cryptology - EUROCRYPT 2016
- 35th Annual International Conference on the Theory and Applications of Cryptographic
Techniques, Vienna, Austria, May 8-12, 2016, Proceedings, Part II, 273--304,
2016. https://doi.org/10.1007/978-3-662-49896-5_10.
ieee: C. Bader, T. Jager, Y. Li, and S. Schäge, “On the Impossibility of Tight Cryptographic
Reductions,” in Advances in Cryptology - EUROCRYPT 2016 - 35th Annual International
Conference on the Theory and Applications of Cryptographic Techniques, Vienna,
Austria, May 8-12, 2016, Proceedings, Part II, 2016, pp. 273--304.
mla: Bader, Christoph, et al. “On the Impossibility of Tight Cryptographic Reductions.”
Advances in Cryptology - EUROCRYPT 2016 - 35th Annual International Conference
on the Theory and Applications of Cryptographic Techniques, Vienna, Austria, May
8-12, 2016, Proceedings, Part II, 2016, pp. 273--304, doi:10.1007/978-3-662-49896-5_10.
short: 'C. Bader, T. Jager, Y. Li, S. Schäge, in: Advances in Cryptology - EUROCRYPT
2016 - 35th Annual International Conference on the Theory and Applications of
Cryptographic Techniques, Vienna, Austria, May 8-12, 2016, Proceedings, Part II,
2016, pp. 273--304.'
date_created: 2018-06-07T09:15:15Z
date_updated: 2022-01-06T06:58:57Z
department:
- _id: '558'
doi: 10.1007/978-3-662-49896-5_10
extern: '1'
page: 273--304
publication: Advances in Cryptology - EUROCRYPT 2016 - 35th Annual International Conference
on the Theory and Applications of Cryptographic Techniques, Vienna, Austria, May
8-12, 2016, Proceedings, Part II
status: public
title: On the Impossibility of Tight Cryptographic Reductions
type: conference
user_id: '38235'
year: '2016'
...
---
_id: '3118'
author:
- first_name: Dennis
full_name: Hofheinz, Dennis
last_name: Hofheinz
- first_name: Tibor
full_name: Jager, Tibor
id: '64669'
last_name: Jager
- first_name: Andy
full_name: Rupp, Andy
last_name: Rupp
citation:
ama: 'Hofheinz D, Jager T, Rupp A. Public-Key Encryption with Simulation-Based Selective-Opening
Security and Compact Ciphertexts. In: Theory of Cryptography - 14th International
Conference, TCC 2016-B, Beijing, China, October 31 - November 3, 2016, Proceedings,
Part II. ; 2016:146--168. doi:10.1007/978-3-662-53644-5_6'
apa: Hofheinz, D., Jager, T., & Rupp, A. (2016). Public-Key Encryption with
Simulation-Based Selective-Opening Security and Compact Ciphertexts. In Theory
of Cryptography - 14th International Conference, TCC 2016-B, Beijing, China, October
31 - November 3, 2016, Proceedings, Part II (pp. 146--168). https://doi.org/10.1007/978-3-662-53644-5_6
bibtex: '@inproceedings{Hofheinz_Jager_Rupp_2016, title={Public-Key Encryption with
Simulation-Based Selective-Opening Security and Compact Ciphertexts}, DOI={10.1007/978-3-662-53644-5_6},
booktitle={Theory of Cryptography - 14th International Conference, TCC 2016-B,
Beijing, China, October 31 - November 3, 2016, Proceedings, Part II}, author={Hofheinz,
Dennis and Jager, Tibor and Rupp, Andy}, year={2016}, pages={146--168} }'
chicago: Hofheinz, Dennis, Tibor Jager, and Andy Rupp. “Public-Key Encryption with
Simulation-Based Selective-Opening Security and Compact Ciphertexts.” In Theory
of Cryptography - 14th International Conference, TCC 2016-B, Beijing, China, October
31 - November 3, 2016, Proceedings, Part II, 146--168, 2016. https://doi.org/10.1007/978-3-662-53644-5_6.
ieee: D. Hofheinz, T. Jager, and A. Rupp, “Public-Key Encryption with Simulation-Based
Selective-Opening Security and Compact Ciphertexts,” in Theory of Cryptography
- 14th International Conference, TCC 2016-B, Beijing, China, October 31 - November
3, 2016, Proceedings, Part II, 2016, pp. 146--168.
mla: Hofheinz, Dennis, et al. “Public-Key Encryption with Simulation-Based Selective-Opening
Security and Compact Ciphertexts.” Theory of Cryptography - 14th International
Conference, TCC 2016-B, Beijing, China, October 31 - November 3, 2016, Proceedings,
Part II, 2016, pp. 146--168, doi:10.1007/978-3-662-53644-5_6.
short: 'D. Hofheinz, T. Jager, A. Rupp, in: Theory of Cryptography - 14th International
Conference, TCC 2016-B, Beijing, China, October 31 - November 3, 2016, Proceedings,
Part II, 2016, pp. 146--168.'
date_created: 2018-06-07T09:15:51Z
date_updated: 2022-01-06T06:58:57Z
department:
- _id: '558'
doi: 10.1007/978-3-662-53644-5_6
extern: '1'
page: 146--168
publication: Theory of Cryptography - 14th International Conference, TCC 2016-B, Beijing,
China, October 31 - November 3, 2016, Proceedings, Part II
status: public
title: Public-Key Encryption with Simulation-Based Selective-Opening Security and
Compact Ciphertexts
type: conference
user_id: '38235'
year: '2016'
...
---
_id: '3119'
author:
- first_name: Dennis
full_name: Hofheinz, Dennis
last_name: Hofheinz
- first_name: Tibor
full_name: Jager, Tibor
id: '64669'
last_name: Jager
citation:
ama: 'Hofheinz D, Jager T. Verifiable Random Functions from Standard Assumptions.
In: Theory of Cryptography - 13th International Conference, TCC 2016-A, Tel
Aviv, Israel, January 10-13, 2016, Proceedings, Part I. ; 2016:336--362. doi:10.1007/978-3-662-49096-9_14'
apa: Hofheinz, D., & Jager, T. (2016). Verifiable Random Functions from Standard
Assumptions. In Theory of Cryptography - 13th International Conference, TCC
2016-A, Tel Aviv, Israel, January 10-13, 2016, Proceedings, Part I (pp. 336--362).
https://doi.org/10.1007/978-3-662-49096-9_14
bibtex: '@inproceedings{Hofheinz_Jager_2016, title={Verifiable Random Functions
from Standard Assumptions}, DOI={10.1007/978-3-662-49096-9_14},
booktitle={Theory of Cryptography - 13th International Conference, TCC 2016-A,
Tel Aviv, Israel, January 10-13, 2016, Proceedings, Part I}, author={Hofheinz,
Dennis and Jager, Tibor}, year={2016}, pages={336--362} }'
chicago: Hofheinz, Dennis, and Tibor Jager. “Verifiable Random Functions from Standard
Assumptions.” In Theory of Cryptography - 13th International Conference, TCC
2016-A, Tel Aviv, Israel, January 10-13, 2016, Proceedings, Part I, 336--362,
2016. https://doi.org/10.1007/978-3-662-49096-9_14.
ieee: D. Hofheinz and T. Jager, “Verifiable Random Functions from Standard Assumptions,”
in Theory of Cryptography - 13th International Conference, TCC 2016-A, Tel
Aviv, Israel, January 10-13, 2016, Proceedings, Part I, 2016, pp. 336--362.
mla: Hofheinz, Dennis, and Tibor Jager. “Verifiable Random Functions from Standard
Assumptions.” Theory of Cryptography - 13th International Conference, TCC 2016-A,
Tel Aviv, Israel, January 10-13, 2016, Proceedings, Part I, 2016, pp. 336--362,
doi:10.1007/978-3-662-49096-9_14.
short: 'D. Hofheinz, T. Jager, in: Theory of Cryptography - 13th International Conference,
TCC 2016-A, Tel Aviv, Israel, January 10-13, 2016, Proceedings, Part I, 2016,
pp. 336--362.'
date_created: 2018-06-07T09:16:30Z
date_updated: 2022-01-06T06:58:57Z
department:
- _id: '558'
doi: 10.1007/978-3-662-49096-9_14
extern: '1'
page: 336--362
publication: Theory of Cryptography - 13th International Conference, TCC 2016-A, Tel
Aviv, Israel, January 10-13, 2016, Proceedings, Part I
status: public
title: Verifiable Random Functions from Standard Assumptions
type: conference
user_id: '38235'
year: '2016'
...
---
_id: '3157'
author:
- first_name: Steffen
full_name: Beringer, Steffen
last_name: Beringer
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Beringer S, Wehrheim H. Verification of AUTOSAR Software Architectures with
Timed Automata. In: H. ter Beek M, Gnesi S, Knapp A, eds. Critical Systems:
Formal Methods and Automated Verification - Joint 21st International Workshop
on Formal Methods for Industrial Critical Systems and 16th International Workshop
on Automated Verification of Critical Systems, FMICS-AVoCS 2016, Pisa, Italy,
September 26-28, 2016, Proceedings. Lecture Notes in Computer Science. ; 2016:189--204.
doi:10.1007/978-3-319-45943-1_13'
apa: 'Beringer, S., & Wehrheim, H. (2016). Verification of AUTOSAR Software
Architectures with Timed Automata. In M. H. ter Beek, S. Gnesi, & A. Knapp
(Eds.), Critical Systems: Formal Methods and Automated Verification - Joint
21st International Workshop on Formal Methods for Industrial Critical Systems
and 16th International Workshop on Automated Verification of Critical Systems,
FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings (pp. 189--204).
https://doi.org/10.1007/978-3-319-45943-1_13'
bibtex: '@inproceedings{Beringer_Wehrheim_2016, series={Lecture Notes in Computer
Science}, title={Verification of AUTOSAR Software Architectures with Timed Automata},
DOI={10.1007/978-3-319-45943-1_13},
booktitle={Critical Systems: Formal Methods and Automated Verification - Joint
21st International Workshop on Formal Methods for Industrial Critical Systems
and 16th International Workshop on Automated Verification of Critical Systems,
FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings}, author={Beringer,
Steffen and Wehrheim, Heike}, editor={H. ter Beek, Maurice and Gnesi, Stefania
and Knapp, AlexanderEditors}, year={2016}, pages={189--204}, collection={Lecture
Notes in Computer Science} }'
chicago: 'Beringer, Steffen, and Heike Wehrheim. “Verification of AUTOSAR Software
Architectures with Timed Automata.” In Critical Systems: Formal Methods and
Automated Verification - Joint 21st International Workshop on Formal Methods for
Industrial Critical Systems and 16th International Workshop on Automated Verification
of Critical Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings,
edited by Maurice H. ter Beek, Stefania Gnesi, and Alexander Knapp, 189--204.
Lecture Notes in Computer Science, 2016. https://doi.org/10.1007/978-3-319-45943-1_13.'
ieee: 'S. Beringer and H. Wehrheim, “Verification of AUTOSAR Software Architectures
with Timed Automata,” in Critical Systems: Formal Methods and Automated Verification
- Joint 21st International Workshop on Formal Methods for Industrial Critical
Systems and 16th International Workshop on Automated Verification of Critical
Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings,
2016, pp. 189--204.'
mla: 'Beringer, Steffen, and Heike Wehrheim. “Verification of AUTOSAR Software Architectures
with Timed Automata.” Critical Systems: Formal Methods and Automated Verification
- Joint 21st International Workshop on Formal Methods for Industrial Critical
Systems and 16th International Workshop on Automated Verification of Critical
Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings,
edited by Maurice H. ter Beek et al., 2016, pp. 189--204, doi:10.1007/978-3-319-45943-1_13.'
short: 'S. Beringer, H. Wehrheim, in: M. H. ter Beek, S. Gnesi, A. Knapp (Eds.),
Critical Systems: Formal Methods and Automated Verification - Joint 21st International
Workshop on Formal Methods for Industrial Critical Systems and 16th International
Workshop on Automated Verification of Critical Systems, FMICS-AVoCS 2016, Pisa,
Italy, September 26-28, 2016, Proceedings, 2016, pp. 189--204.'
date_created: 2018-06-13T07:39:35Z
date_updated: 2022-01-06T06:59:01Z
ddc:
- '000'
department:
- _id: '77'
doi: 10.1007/978-3-319-45943-1_13
editor:
- first_name: Maurice
full_name: H. ter Beek, Maurice
last_name: H. ter Beek
- first_name: Stefania
full_name: Gnesi, Stefania
last_name: Gnesi
- first_name: Alexander
full_name: Knapp, Alexander
last_name: Knapp
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:17:13Z
date_updated: 2018-11-02T14:17:13Z
file_id: '5267'
file_name: VerificationOfAUTOSARSoftwareA.pdf
file_size: 2640695
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:17:13Z
has_accepted_license: '1'
language:
- iso: eng
page: 189--204
project:
- _id: '3'
name: SFB 901 - Project Area B
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subproject B3
publication: 'Critical Systems: Formal Methods and Automated Verification - Joint
21st International Workshop on Formal Methods for Industrial Critical Systems and
16th International Workshop on Automated Verification of Critical Systems, FMICS-AVoCS
2016, Pisa, Italy, September 26-28, 2016, Proceedings'
series_title: Lecture Notes in Computer Science
status: public
title: Verification of AUTOSAR Software Architectures with Timed Automata
type: conference
user_id: '477'
year: '2016'
...
---
_id: '3158'
author:
- first_name: Oleg
full_name: Travkin, Oleg
last_name: Travkin
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Travkin O, Wehrheim H. Verification of Concurrent Programs on Weak Memory
Models. In: Sampaio A, Wang F, eds. Theoretical Aspects of Computing - {ICTAC}
2016 - 13th International Colloquium, Taipei, Taiwan, ROC, October 24-31, 2016,
Proceedings. Lecture Notes in Computer Science. ; 2016:3--24. doi:10.1007/978-3-319-46750-4_1'
apa: Travkin, O., & Wehrheim, H. (2016). Verification of Concurrent Programs
on Weak Memory Models. In A. Sampaio & F. Wang (Eds.), Theoretical Aspects
of Computing - {ICTAC} 2016 - 13th International Colloquium, Taipei, Taiwan, ROC,
October 24-31, 2016, Proceedings (pp. 3--24). https://doi.org/10.1007/978-3-319-46750-4_1
bibtex: '@inproceedings{Travkin_Wehrheim_2016, series={Lecture Notes in Computer
Science}, title={Verification of Concurrent Programs on Weak Memory Models}, DOI={10.1007/978-3-319-46750-4_1},
booktitle={Theoretical Aspects of Computing - {ICTAC} 2016 - 13th International
Colloquium, Taipei, Taiwan, ROC, October 24-31, 2016, Proceedings}, author={Travkin,
Oleg and Wehrheim, Heike}, editor={Sampaio, Augusto and Wang, FarnEditors}, year={2016},
pages={3--24}, collection={Lecture Notes in Computer Science} }'
chicago: Travkin, Oleg, and Heike Wehrheim. “Verification of Concurrent Programs
on Weak Memory Models.” In Theoretical Aspects of Computing - {ICTAC} 2016
- 13th International Colloquium, Taipei, Taiwan, ROC, October 24-31, 2016, Proceedings,
edited by Augusto Sampaio and Farn Wang, 3--24. Lecture Notes in Computer Science,
2016. https://doi.org/10.1007/978-3-319-46750-4_1.
ieee: O. Travkin and H. Wehrheim, “Verification of Concurrent Programs on Weak Memory
Models,” in Theoretical Aspects of Computing - {ICTAC} 2016 - 13th International
Colloquium, Taipei, Taiwan, ROC, October 24-31, 2016, Proceedings, 2016, pp.
3--24.
mla: Travkin, Oleg, and Heike Wehrheim. “Verification of Concurrent Programs on
Weak Memory Models.” Theoretical Aspects of Computing - {ICTAC} 2016 - 13th
International Colloquium, Taipei, Taiwan, ROC, October 24-31, 2016, Proceedings,
edited by Augusto Sampaio and Farn Wang, 2016, pp. 3--24, doi:10.1007/978-3-319-46750-4_1.
short: 'O. Travkin, H. Wehrheim, in: A. Sampaio, F. Wang (Eds.), Theoretical Aspects
of Computing - {ICTAC} 2016 - 13th International Colloquium, Taipei, Taiwan, ROC,
October 24-31, 2016, Proceedings, 2016, pp. 3--24.'
date_created: 2018-06-13T07:41:07Z
date_updated: 2022-01-06T06:59:01Z
department:
- _id: '77'
doi: 10.1007/978-3-319-46750-4_1
editor:
- first_name: Augusto
full_name: Sampaio, Augusto
last_name: Sampaio
- first_name: Farn
full_name: Wang, Farn
last_name: Wang
page: 3--24
publication: Theoretical Aspects of Computing - {ICTAC} 2016 - 13th International
Colloquium, Taipei, Taiwan, ROC, October 24-31, 2016, Proceedings
series_title: Lecture Notes in Computer Science
status: public
title: Verification of Concurrent Programs on Weak Memory Models
type: conference
user_id: '29719'
year: '2016'
...
---
_id: '3159'
author:
- first_name: Gerhard
full_name: Schellhorn, Gerhard
last_name: Schellhorn
- first_name: Oleg
full_name: Travkin, Oleg
last_name: Travkin
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Schellhorn G, Travkin O, Wehrheim H. Towards a Thread-Local Proof Technique
for Starvation Freedom. In: Huisman M, ed. Integrated Formal Methods - 12th
International Conference, {IFM} 2016, Reykjavik, Iceland, June 1-5, 2016, Proceedings.
Lecture Notes in Computer Science. ; 2016:193--209. doi:10.1007/978-3-319-33693-0_13'
apa: Schellhorn, G., Travkin, O., & Wehrheim, H. (2016). Towards a Thread-Local
Proof Technique for Starvation Freedom. In M. Huisman (Ed.), Integrated Formal
Methods - 12th International Conference, {IFM} 2016, Reykjavik, Iceland, June
1-5, 2016, Proceedings (pp. 193--209). https://doi.org/10.1007/978-3-319-33693-0_13
bibtex: '@inproceedings{Schellhorn_Travkin_Wehrheim_2016, series={Lecture Notes
in Computer Science}, title={Towards a Thread-Local Proof Technique for Starvation
Freedom}, DOI={10.1007/978-3-319-33693-0_13},
booktitle={Integrated Formal Methods - 12th International Conference, {IFM} 2016,
Reykjavik, Iceland, June 1-5, 2016, Proceedings}, author={Schellhorn, Gerhard
and Travkin, Oleg and Wehrheim, Heike}, editor={Huisman, MariekeEditor}, year={2016},
pages={193--209}, collection={Lecture Notes in Computer Science} }'
chicago: Schellhorn, Gerhard, Oleg Travkin, and Heike Wehrheim. “Towards a Thread-Local
Proof Technique for Starvation Freedom.” In Integrated Formal Methods - 12th
International Conference, {IFM} 2016, Reykjavik, Iceland, June 1-5, 2016, Proceedings,
edited by Marieke Huisman, 193--209. Lecture Notes in Computer Science, 2016.
https://doi.org/10.1007/978-3-319-33693-0_13.
ieee: G. Schellhorn, O. Travkin, and H. Wehrheim, “Towards a Thread-Local Proof
Technique for Starvation Freedom,” in Integrated Formal Methods - 12th International
Conference, {IFM} 2016, Reykjavik, Iceland, June 1-5, 2016, Proceedings, 2016,
pp. 193--209.
mla: Schellhorn, Gerhard, et al. “Towards a Thread-Local Proof Technique for Starvation
Freedom.” Integrated Formal Methods - 12th International Conference, {IFM}
2016, Reykjavik, Iceland, June 1-5, 2016, Proceedings, edited by Marieke Huisman,
2016, pp. 193--209, doi:10.1007/978-3-319-33693-0_13.
short: 'G. Schellhorn, O. Travkin, H. Wehrheim, in: M. Huisman (Ed.), Integrated
Formal Methods - 12th International Conference, {IFM} 2016, Reykjavik, Iceland,
June 1-5, 2016, Proceedings, 2016, pp. 193--209.'
date_created: 2018-06-13T07:42:34Z
date_updated: 2022-01-06T06:59:01Z
department:
- _id: '77'
doi: 10.1007/978-3-319-33693-0_13
editor:
- first_name: Marieke
full_name: Huisman, Marieke
last_name: Huisman
page: 193--209
publication: Integrated Formal Methods - 12th International Conference, {IFM} 2016,
Reykjavik, Iceland, June 1-5, 2016, Proceedings
series_title: Lecture Notes in Computer Science
status: public
title: Towards a Thread-Local Proof Technique for Starvation Freedom
type: conference
user_id: '29719'
year: '2016'
...
---
_id: '3160'
author:
- first_name: Simon
full_name: Doherty, Simon
last_name: Doherty
- first_name: Brijesh
full_name: Dongol, Brijesh
last_name: Dongol
- first_name: John
full_name: Derrick, John
last_name: Derrick
- first_name: Gerhard
full_name: Schellhorn, Gerhard
last_name: Schellhorn
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Doherty S, Dongol B, Derrick J, Schellhorn G, Wehrheim H. Proving Opacity
of a Pessimistic {STM}. In: Fatourou P, Jim{\’{e}}nez E, Pedone F, eds. 20th
International Conference on Principles of Distributed Systems, {OPODIS} 2016,
December 13-16, 2016, Madrid, Spain. LIPIcs. ; 2016:35:1--35:17. doi:10.4230/LIPIcs.OPODIS.2016.35'
apa: Doherty, S., Dongol, B., Derrick, J., Schellhorn, G., & Wehrheim, H. (2016).
Proving Opacity of a Pessimistic {STM}. In P. Fatourou, E. Jim{\’{e}}nez, &
F. Pedone (Eds.), 20th International Conference on Principles of Distributed
Systems, {OPODIS} 2016, December 13-16, 2016, Madrid, Spain (pp. 35:1--35:17).
https://doi.org/10.4230/LIPIcs.OPODIS.2016.35
bibtex: '@inproceedings{Doherty_Dongol_Derrick_Schellhorn_Wehrheim_2016, series={LIPIcs},
title={Proving Opacity of a Pessimistic {STM}}, DOI={10.4230/LIPIcs.OPODIS.2016.35},
booktitle={20th International Conference on Principles of Distributed Systems,
{OPODIS} 2016, December 13-16, 2016, Madrid, Spain}, author={Doherty, Simon and
Dongol, Brijesh and Derrick, John and Schellhorn, Gerhard and Wehrheim, Heike},
editor={Fatourou, Panagiota and Jim{\’{e}}nez, Ernesto and Pedone, FernandoEditors},
year={2016}, pages={35:1--35:17}, collection={LIPIcs} }'
chicago: Doherty, Simon, Brijesh Dongol, John Derrick, Gerhard Schellhorn, and Heike
Wehrheim. “Proving Opacity of a Pessimistic {STM}.” In 20th International Conference
on Principles of Distributed Systems, {OPODIS} 2016, December 13-16, 2016, Madrid,
Spain, edited by Panagiota Fatourou, Ernesto Jim{\’{e}}nez, and Fernando Pedone,
35:1--35:17. LIPIcs, 2016. https://doi.org/10.4230/LIPIcs.OPODIS.2016.35.
ieee: S. Doherty, B. Dongol, J. Derrick, G. Schellhorn, and H. Wehrheim, “Proving
Opacity of a Pessimistic {STM},” in 20th International Conference on Principles
of Distributed Systems, {OPODIS} 2016, December 13-16, 2016, Madrid, Spain,
2016, pp. 35:1--35:17.
mla: Doherty, Simon, et al. “Proving Opacity of a Pessimistic {STM}.” 20th International
Conference on Principles of Distributed Systems, {OPODIS} 2016, December 13-16,
2016, Madrid, Spain, edited by Panagiota Fatourou et al., 2016, pp. 35:1--35:17,
doi:10.4230/LIPIcs.OPODIS.2016.35.
short: 'S. Doherty, B. Dongol, J. Derrick, G. Schellhorn, H. Wehrheim, in: P. Fatourou,
E. Jim{\’{e}}nez, F. Pedone (Eds.), 20th International Conference on Principles
of Distributed Systems, {OPODIS} 2016, December 13-16, 2016, Madrid, Spain, 2016,
pp. 35:1--35:17.'
date_created: 2018-06-13T07:44:15Z
date_updated: 2022-01-06T06:59:01Z
department:
- _id: '77'
doi: 10.4230/LIPIcs.OPODIS.2016.35
editor:
- first_name: Panagiota
full_name: Fatourou, Panagiota
last_name: Fatourou
- first_name: Ernesto
full_name: Jim{\'{e}}nez, Ernesto
last_name: Jim{\'{e}}nez
- first_name: Fernando
full_name: Pedone, Fernando
last_name: Pedone
page: 35:1--35:17
project:
- _id: '78'
name: Validation of Software Transactional Memory
publication: 20th International Conference on Principles of Distributed Systems, {OPODIS}
2016, December 13-16, 2016, Madrid, Spain
series_title: LIPIcs
status: public
title: Proving Opacity of a Pessimistic {STM}
type: conference
user_id: '29719'
year: '2016'
...
---
_id: '3161'
author:
- first_name: Tobias
full_name: Isenberg, Tobias
last_name: Isenberg
- first_name: Marie{-}Christine
full_name: Jakobs, Marie{-}Christine
last_name: Jakobs
- first_name: Felix
full_name: Pauck, Felix
last_name: Pauck
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: Isenberg T, Jakobs M-}Christine, Pauck F, Wehrheim H. Deriving approximation
tolerance constraints from verification runs. CoRR. 2016.
apa: Isenberg, T., Jakobs, M.-}Christine, Pauck, F., & Wehrheim, H. (2016).
Deriving approximation tolerance constraints from verification runs. CoRR.
bibtex: '@article{Isenberg_Jakobs_Pauck_Wehrheim_2016, title={Deriving approximation
tolerance constraints from verification runs}, journal={CoRR}, author={Isenberg,
Tobias and Jakobs, Marie{-}Christine and Pauck, Felix and Wehrheim, Heike}, year={2016}
}'
chicago: Isenberg, Tobias, Marie{-}Christine Jakobs, Felix Pauck, and Heike Wehrheim.
“Deriving Approximation Tolerance Constraints from Verification Runs.” CoRR,
2016.
ieee: T. Isenberg, M.-}Christine Jakobs, F. Pauck, and H. Wehrheim, “Deriving approximation
tolerance constraints from verification runs,” CoRR, 2016.
mla: Isenberg, Tobias, et al. “Deriving Approximation Tolerance Constraints from
Verification Runs.” CoRR, 2016.
short: T. Isenberg, M.-}Christine Jakobs, F. Pauck, H. Wehrheim, CoRR (2016).
date_created: 2018-06-13T07:45:27Z
date_updated: 2022-01-06T06:59:01Z
department:
- _id: '77'
publication: CoRR
status: public
title: Deriving approximation tolerance constraints from verification runs
type: journal_article
user_id: '29719'
year: '2016'
...
---
_id: '210'
author:
- first_name: Lennart
full_name: Leder, Lennart
last_name: Leder
citation:
ama: Leder L. Congestion Games with Mixed Objectives. Universität Paderborn;
2016.
apa: Leder, L. (2016). Congestion Games with Mixed Objectives. Universität
Paderborn.
bibtex: '@book{Leder_2016, title={Congestion Games with Mixed Objectives}, publisher={Universität
Paderborn}, author={Leder, Lennart}, year={2016} }'
chicago: Leder, Lennart. Congestion Games with Mixed Objectives. Universität
Paderborn, 2016.
ieee: L. Leder, Congestion Games with Mixed Objectives. Universität Paderborn,
2016.
mla: Leder, Lennart. Congestion Games with Mixed Objectives. Universität
Paderborn, 2016.
short: L. Leder, Congestion Games with Mixed Objectives, Universität Paderborn,
2016.
date_created: 2017-10-17T12:41:33Z
date_updated: 2022-01-06T06:54:42Z
department:
- _id: '63'
- _id: '541'
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
title: Congestion Games with Mixed Objectives
type: mastersthesis
user_id: '14052'
year: '2016'
...
---
_id: '213'
author:
- first_name: Laurens
full_name: Porzenheim, Laurens
last_name: Porzenheim
citation:
ama: Porzenheim L. Comparison of Different Definitions of Chosen-Ciphertext Security
in Encryption Schemes. Universität Paderborn; 2016.
apa: Porzenheim, L. (2016). Comparison of different Definitions of Chosen-Ciphertext
Security in Encryption schemes. Universität Paderborn.
bibtex: '@book{Porzenheim_2016, title={Comparison of different Definitions of Chosen-Ciphertext
Security in Encryption schemes}, publisher={Universität Paderborn}, author={Porzenheim,
Laurens}, year={2016} }'
chicago: Porzenheim, Laurens. Comparison of Different Definitions of Chosen-Ciphertext
Security in Encryption Schemes. Universität Paderborn, 2016.
ieee: L. Porzenheim, Comparison of different Definitions of Chosen-Ciphertext
Security in Encryption schemes. Universität Paderborn, 2016.
mla: Porzenheim, Laurens. Comparison of Different Definitions of Chosen-Ciphertext
Security in Encryption Schemes. Universität Paderborn, 2016.
short: L. Porzenheim, Comparison of Different Definitions of Chosen-Ciphertext Security
in Encryption Schemes, Universität Paderborn, 2016.
date_created: 2017-10-17T12:41:33Z
date_updated: 2022-01-06T06:54:53Z
department:
- _id: '64'
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: Comparison of different Definitions of Chosen-Ciphertext Security in Encryption
schemes
type: bachelorsthesis
user_id: '477'
year: '2016'
...
---
_id: '214'
author:
- first_name: Kai Sören
full_name: Bemmann, Kai Sören
last_name: Bemmann
citation:
ama: Bemmann KS. Commitment Schemes - Definitions, Variants, and Security.
Universität Paderborn; 2016.
apa: Bemmann, K. S. (2016). Commitment Schemes - Definitions, Variants, and Security.
Universität Paderborn.
bibtex: '@book{Bemmann_2016, title={Commitment Schemes - Definitions, Variants,
and Security}, publisher={Universität Paderborn}, author={Bemmann, Kai Sören},
year={2016} }'
chicago: Bemmann, Kai Sören. Commitment Schemes - Definitions, Variants, and
Security. Universität Paderborn, 2016.
ieee: K. S. Bemmann, Commitment Schemes - Definitions, Variants, and Security.
Universität Paderborn, 2016.
mla: Bemmann, Kai Sören. Commitment Schemes - Definitions, Variants, and Security.
Universität Paderborn, 2016.
short: K.S. Bemmann, Commitment Schemes - Definitions, Variants, and Security, Universität
Paderborn, 2016.
date_created: 2017-10-17T12:41:33Z
date_updated: 2022-01-06T06:54:58Z
department:
- _id: '64'
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: Commitment Schemes - Definitions, Variants, and Security
type: bachelorsthesis
user_id: '477'
year: '2016'
...
---
_id: '215'
abstract:
- lang: eng
text: 'We present three robust overlay networks: First, we present a network that
organizes the nodes into an expander and is resistant to even massive adversarial
churn. Second, we develop a network based on the hypercube that maintains connectivity
under adversarial DoS-attacks. For the DoS-attacks we use the notion of a Omega(log
log n)-late adversary which only has access to topological information that is
at least Omega(log log n) rounds old. Finally, we develop a network that combines
both churn- and DoS-resistance. The networks gain their robustness through constant
network reconfiguration, i.e., the topology of the networks changes constantly.
Our reconguration algorithms are based on node sampling primitives for expanders
and hypercubes that allow each node to sample a logarithmic number of nodes uniformly
at random in O(log log n) communication rounds. These primitives are specific
to overlay networks and their optimal runtime represents an exponential improvement
over known techniques. Our results have a wide range of applications, for example
in the area of scalable and robust peer-to-peer systems.'
author:
- first_name: Maximilian
full_name: Drees, Maximilian
last_name: Drees
- first_name: Robert
full_name: Gmyr, Robert
last_name: Gmyr
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Drees M, Gmyr R, Scheideler C. Churn- and DoS-resistant Overlay Networks Based
on Network Reconfiguration. In: Proceedings of the 28th ACM Symposium on Parallelism
in Algorithms and Architectures (SPAA). ; 2016:417--427. doi:10.1145/2935764.2935783'
apa: Drees, M., Gmyr, R., & Scheideler, C. (2016). Churn- and DoS-resistant
Overlay Networks Based on Network Reconfiguration. In Proceedings of the 28th
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 417--427).
https://doi.org/10.1145/2935764.2935783
bibtex: '@inproceedings{Drees_Gmyr_Scheideler_2016, title={Churn- and DoS-resistant
Overlay Networks Based on Network Reconfiguration}, DOI={10.1145/2935764.2935783},
booktitle={Proceedings of the 28th ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA)}, author={Drees, Maximilian and Gmyr, Robert and Scheideler,
Christian}, year={2016}, pages={417--427} }'
chicago: Drees, Maximilian, Robert Gmyr, and Christian Scheideler. “Churn- and DoS-Resistant
Overlay Networks Based on Network Reconfiguration.” In Proceedings of the 28th
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 417--427,
2016. https://doi.org/10.1145/2935764.2935783.
ieee: M. Drees, R. Gmyr, and C. Scheideler, “Churn- and DoS-resistant Overlay Networks
Based on Network Reconfiguration,” in Proceedings of the 28th ACM Symposium
on Parallelism in Algorithms and Architectures (SPAA), 2016, pp. 417--427.
mla: Drees, Maximilian, et al. “Churn- and DoS-Resistant Overlay Networks Based
on Network Reconfiguration.” Proceedings of the 28th ACM Symposium on Parallelism
in Algorithms and Architectures (SPAA), 2016, pp. 417--427, doi:10.1145/2935764.2935783.
short: 'M. Drees, R. Gmyr, C. Scheideler, in: Proceedings of the 28th ACM Symposium
on Parallelism in Algorithms and Architectures (SPAA), 2016, pp. 417--427.'
date_created: 2017-10-17T12:41:33Z
date_updated: 2022-01-06T06:55:02Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
doi: 10.1145/2935764.2935783
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T10:41:40Z
date_updated: 2018-03-21T10:41:40Z
file_id: '1518'
file_name: 215-SPAA16-Drees_Gmyr_Scheideler.pdf
file_size: 352996
relation: main_file
success: 1
file_date_updated: 2018-03-21T10:41:40Z
has_accepted_license: '1'
language:
- iso: eng
page: 417--427
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and
Architectures (SPAA)
status: public
title: Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration
type: conference
user_id: '14955'
year: '2016'
...