@inbook{3536,
author = {Schellhorn, Gerhard and Wedel, Monika and Travkin, Oleg and König, Jürgen and Wehrheim, Heike},
booktitle = {Software Engineering and Formal Methods},
isbn = {9783319929699},
issn = {0302-9743},
pages = {105--120},
publisher = {Springer International Publishing},
title = {{FastLane Is Opaque – a Case Study in Mechanized Proofs of Opacity}},
doi = {10.1007/978-3-319-92970-5_7},
year = {2018},
}
@inproceedings{2862,
author = {Blömer, Johannes and Eidens, Fabian and Juhnke, Jakob},
booktitle = {Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers' Track at the {RSA} Conference 2018, Proceedings},
isbn = {9783319769523},
issn = {0302-9743},
location = {San Francisco, CA, USA},
pages = {470--490},
publisher = {Springer International Publishing},
title = {{Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems}},
doi = {10.1007/978-3-319-76953-0_25},
year = {2018},
}
@inproceedings{3373,
abstract = {Modern Boolean satisfiability solvers can emit proofs of unsatisfiability. There is substantial interest in being able to verify such proofs and also in using them for further computations. In this paper, we present an FPGA accelerator for checking resolution proofs, a popular proof format. Our accelerator exploits parallelism at the low level by implementing the basic resolution step in hardware, and at the high level by instantiating a number of parallel modules for proof checking. Since proof checking involves highly irregular memory accesses, we employ Hybrid Memory Cube technology for accelerator memory. The results show that while the accelerator is scalable and achieves speedups for all benchmark proofs, performance improvements are currently limited by the overhead of transitioning the proof into the accelerator memory.},
author = {Hansmeier, Tim and Platzner, Marco and Andrews, David},
booktitle = {ARC 2018: Applied Reconfigurable Computing. Architectures, Tools, and Applications},
isbn = {9783319788890},
issn = {0302-9743},
location = {Santorini, Greece},
pages = {153--165},
publisher = {Springer International Publishing},
title = {{An FPGA/HMC-Based Accelerator for Resolution Proof Checking}},
doi = {10.1007/978-3-319-78890-6_13},
volume = {10824},
year = {2018},
}
@inbook{6423,
author = {Schäfer, Dirk and Hüllermeier, Eyke},
booktitle = {Discovery Science},
isbn = {9783030017705},
issn = {0302-9743},
pages = {161--175},
publisher = {Springer International Publishing},
title = {{Preference-Based Reinforcement Learning Using Dyad Ranking}},
doi = {10.1007/978-3-030-01771-2_11},
year = {2018},
}
@inproceedings{3362,
abstract = {Profiling applications on a heterogeneous compute node is challenging since the way to retrieve data from the resources and interpret them varies between resource types and manufacturers. This holds especially true for measuring the energy consumption. In this paper we present Ampehre, a novel open source measurement framework that allows developers to gather comparable measurements from heterogeneous compute nodes, e.g., nodes comprising CPU, GPU, and FPGA. We explain the architecture of Ampehre and detail the measurement process on the example of energy measurements on CPU and GPU. To characterize the probing effect, we quantitatively analyze the trade-off between the accuracy of measurements and the CPU load imposed by Ampehre. Based on this analysis, we are able to specify reasonable combinations of sampling periods for the different resource types of a compute node.},
author = {Lösch, Achim and Wiens, Alex and Platzner, Marco},
booktitle = {Proceedings of the International Conference on Architecture of Computing Systems (ARCS)},
isbn = {9783319776095},
issn = {0302-9743},
pages = {73--84},
publisher = {Springer International Publishing},
title = {{Ampehre: An Open Source Measurement Framework for Heterogeneous Compute Nodes}},
doi = {10.1007/978-3-319-77610-1_6},
volume = {10793},
year = {2018},
}
@inbook{6253,
author = {Senft, Björn and Fischer, Holger Gerhard and Oberthür, Simon and Patkar, Nitish},
booktitle = {Design, User Experience, and Usability: Theory and Practice},
isbn = {9783319917962},
issn = {0302-9743},
location = {Las Vegas, USA},
pages = {758--770},
publisher = {Springer International Publishing},
title = {{Assist Users to Straightaway Suggest and Describe Experienced Problems}},
doi = {10.1007/978-3-319-91797-9_52},
volume = {10918},
year = {2018},
}
@inproceedings{5774,
abstract = {Information flow analysis investigates the flow of data in applications, checking in particular for flows from private sources to public sinks. Flow- and path-sensitive analyses are, however, often too costly to be performed every time a security-critical application is run. In this paper, we propose a variant of proof carrying code for information flow security. To this end, we develop information flow (IF) certificates which get attached to programs as well as a method for IF certificate validation. We prove soundness of our technique, i.e., show it to be tamper-free. The technique is implemented within the program analysis tool CPAchecker. Our experiments confirm that the use of certificates pays off for costly analysis runs.},
author = {Töws, Manuel and Wehrheim, Heike},
booktitle = {Theoretical Aspects of Computing – ICTAC 2018},
isbn = {9783030025076},
issn = {0302-9743},
pages = {435--454},
publisher = {Springer International Publishing},
title = {{Information Flow Certificates}},
doi = {10.1007/978-3-030-02508-3_23},
year = {2018},
}
@inbook{6254,
author = {Fischer, Holger Gerhard and Senft, Björn and Rittmeier, Florian and Sauer, Stefan},
booktitle = {Design, User Experience, and Usability: Theory and Practice. Proceedings of the 20th International Conference on Human-Computer Interaktion (HCI International 2018)},
editor = {Marcus, Aaron and Wang, Wentao},
isbn = {9783319917962},
issn = {0302-9743},
location = {Las Vegas, USA},
pages = {711--724},
publisher = {Springer International Publishing},
title = {{A Canvas Method to Foster Interdisciplinary Discussions on Digital Assistance Systems}},
doi = {10.1007/978-3-319-91797-9_49},
volume = {10918},
year = {2018},
}
@inproceedings{2967,
author = {Blömer, Johannes and Liske, Gennadij},
booktitle = {Proceedings of the International Conference of Mathematical Aspects of Computer and Information Sciences (MACIS)},
isbn = {9783319724522},
issn = {0302-9743},
pages = {438--453},
publisher = {Springer International Publishing},
title = {{Subtleties in Security Definitions for Predicate Encryption with Public Index}},
doi = {10.1007/978-3-319-72453-9_35},
volume = {10693},
year = {2017},
}
@inbook{6255,
author = {Fischer, Holger Gerhard and Engler, Michael and Sauer, Stefan},
booktitle = {Design, User Experience, and Usability: Theory, Methodology, and Management},
isbn = {9783319586335},
issn = {0302-9743},
location = {Vancouver, Canada},
pages = {570--583},
publisher = {Springer International Publishing},
title = {{A Human-Centered Perspective on Software Quality: Acceptance Criteria for Work 4.0}},
doi = {10.1007/978-3-319-58634-2_42},
volume = {10288},
year = {2017},
}
@inproceedings{5769,
abstract = {Information Flow Analysis (IFA) aims at detecting illegal flows of information between program entities. “Legality” is therein specified in terms of various security policies. For the analysis, this opens up two possibilities: building generic, policy independent and building specific, policy dependent IFAs. While the former needs to track all dependencies between program entities, the latter allows for a reduced and thus more efficient analysis.
In this paper, we start out by formally defining a policy independent information flow analysis. Next, we show how to specialize this IFA via policy specific variable tracking, and prove soundness of the specialization. We furthermore investigate refinement relationships between policies, allowing an IFA for one policy to be employed for its refinements. As policy refinement depends on concrete program entities, we additionally propose a precomputation of policy refinement conditions, enabling an efficient refinement check for concrete programs.},
author = {Töws, Manuel and Wehrheim, Heike},
booktitle = {Formal Methods and Software Engineering - 19th International Conference on Formal Engineering Methods (ICFEM 2017)},
isbn = {9783319686899},
issn = {0302-9743},
pages = {362--378},
publisher = {Springer International Publishing},
title = {{Policy Dependent and Independent Information Flow Analyses}},
doi = {10.1007/978-3-319-68690-5_22},
year = {2017},
}
@inbook{2381,
abstract = {Metric facility location and K-means are well-known problems of combinatorial optimization. Both admit a fairly simple heuristic called single-swap, which adds, drops or swaps open facilities until it reaches a local optimum. For both problems, it is known that this algorithm produces a solution that is at most a constant factor worse than the respective global optimum. In this paper, we show that single-swap applied to the weighted metric uncapacitated facility location and weighted discrete K-means problem is tightly PLS-complete and hence has exponential worst-case running time.},
author = {Brauer, Sascha},
booktitle = {Lecture Notes in Computer Science},
editor = {Fotakis, Dimitris and Pagourtzis, Aris and Paschos, Vangelis Th.},
isbn = {9783319575858},
issn = {0302-9743},
location = {Athens, Greece},
pages = {116--127},
publisher = {Springer International Publishing},
title = {{Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems}},
doi = {10.1007/978-3-319-57586-5_11},
volume = {10236},
year = {2017},
}
@inproceedings{2344,
author = {Blömer, Johannes and Günther, Peter and Krummel, Volker and Löken, Nils},
booktitle = {Foundations and Practice of Security},
isbn = {9783319756493},
issn = {0302-9743},
pages = {3--17},
publisher = {Springer International Publishing},
title = {{Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations}},
doi = {10.1007/978-3-319-75650-9_1},
year = {2017},
}
@inbook{2948,
author = {Günther, Peter and Krummel, Volker},
booktitle = {Mathematical Aspects of Computer and Information Sciences},
isbn = {9783319328584},
issn = {0302-9743},
pages = {151--165},
publisher = {Springer International Publishing},
title = {{Implementing Cryptographic Pairings on Accumulator Based Smart Card Architectures}},
doi = {10.1007/978-3-319-32859-1_13},
year = {2016},
}
@inbook{2968,
author = {Blömer, Johannes and Lammersen, Christiane and Schmidt, Melanie and Sohler, Christian},
booktitle = {Algorithm Engineering},
isbn = {9783319494869},
issn = {0302-9743},
pages = {81--116},
publisher = {Springer International Publishing},
title = {{Theoretical Analysis of the k-Means Algorithm – A Survey}},
doi = {10.1007/978-3-319-49487-6_3},
year = {2016},
}
@inbook{2970,
author = {Blömer, Johannes and Bujna, Kathrin},
booktitle = {Advances in Knowledge Discovery and Data Mining},
isbn = {9783319317496},
issn = {0302-9743},
pages = {296--308},
publisher = {Springer International Publishing},
title = {{Adaptive Seeding for Gaussian Mixture Models}},
doi = {10.1007/978-3-319-31750-2_24},
year = {2016},
}
@inbook{6257,
author = {Fischer, Holger Gerhard and Senft, Björn},
booktitle = {Human-Centered and Error-Resilient Systems Development},
editor = {Bogdan, Christian},
isbn = {9783319449012},
issn = {0302-9743},
location = {Stockholm, Sweden},
pages = {30--41},
publisher = {Springer International Publishing},
title = {{Human-Centered Software Engineering as a Chance to Ensure Software Quality Within the Digitization of Human Workflows}},
doi = {10.1007/978-3-319-44902-9_3},
volume = {9856},
year = {2016},
}
@inproceedings{5825,
abstract = {Integrating apps on mobile devices into applications running on other devices is usually difficult. For instance, using a messenger on a smartphone to share a text written on a desktop computer often ends up in a cumbersome solution to transfer the text, because many applications are not designed for such scenarios. In this paper, we present an approach enabling the integration of apps running on Android devices into applications running on other devices and even other platforms. This is achieved by specifying adapters for Android apps, which map their services to a platform-independent service interface. For this purpose, we have developed a domain-specific language to ease the specification of such mappings. Our approach is applicable without the need to modify the existing Android apps providing the service. We analyzed its feasibility by implementing our approach and by specifying mappings for several popular Android apps, e.g., phone book, camera, and file explorer.},
author = {Wolters, Dennis and Kirchhoff, Jonas and Gerth, Christian and Engels, Gregor},
booktitle = {Service-Oriented Computing},
editor = {Sheng, Quan Z. and Stroulia, Eleni and Tata, Samir and Bhiri, Sami },
isbn = {9783319462943},
issn = {0302-9743},
keyword = {Cross-Device, Integration, Android, Adapter, DSL},
pages = {171--185},
publisher = {Springer International Publishing},
title = {{Cross-Device Integration of Android Apps}},
doi = {10.1007/978-3-319-46295-0_11},
year = {2016},
}
@inbook{2921,
author = {Blazy, Olivier and Kakvi, Saqib and Kiltz, Eike and Pan, Jiaxin},
booktitle = {Lecture Notes in Computer Science},
isbn = {9783662464465},
issn = {0302-9743},
pages = {256--279},
publisher = {Springer Berlin Heidelberg},
title = {{Tightly-Secure Signatures from Chameleon Hash Functions}},
doi = {10.1007/978-3-662-46447-2_12},
year = {2015},
}
@inproceedings{6741,
author = {Bokermann, Dennis and Gerth, Christian and Engels, Gregor},
booktitle = {12th International Conference on Business Process Management (BPM 2014)},
isbn = {9783319101712},
issn = {0302-9743},
pages = {357--365},
publisher = {Springer International Publishing},
title = {{Use Your Best Device! Enabling Device Changes at Runtime}},
doi = {10.1007/978-3-319-10172-9_23},
volume = {8659},
year = {2014},
}
@inbook{2979,
author = {Blömer, Johannes and Günther, Peter and Liske, Gennadij},
booktitle = {Constructive Side-Channel Analysis and Secure Design},
isbn = {9783642400254},
issn = {0302-9743},
pages = {154--168},
publisher = {Springer Berlin Heidelberg},
title = {{Improved Side Channel Attacks on Pairing Based Cryptography}},
doi = {10.1007/978-3-642-40026-1_10},
year = {2013},
}
@inbook{6279,
author = {Fischer, Holger Gerhard and Strenge, Benjamin and Nebe, Karsten},
booktitle = {Design, User Experience, and Usability. Design Philosophy, Methods, and Tools},
isbn = {9783642392283},
issn = {0302-9743},
location = {Las Vegas, USA},
pages = {252--261},
publisher = {Springer Berlin Heidelberg},
title = {{Towards a Holistic Tool for the Selection and Validation of Usability Method Sets Supporting Human-Centered Design}},
doi = {10.1007/978-3-642-39229-0_28},
volume = {8012},
year = {2013},
}
@inproceedings{6732,
author = {Place, Thomas and van Rooijen, Lorijn and Zeitoun, Marc},
booktitle = {Mathematical Foundations of Computer Science 2013 - 38th International Symposium, (MFCS) 2013, Klosterneuburg, Austria, August 26-30, 2013},
isbn = {9783642403125},
issn = {0302-9743},
pages = {729--740},
publisher = {Springer Berlin Heidelberg},
title = {{Separating Regular Languages by Piecewise Testable and Unambiguous Languages}},
doi = {10.1007/978-3-642-40313-2_64},
year = {2013},
}
@inbook{6276,
author = {Klompmaker, Florian and Paelke, Volker and Fischer, Holger Gerhard},
booktitle = {Distributed, Ambient, and Pervasive Interactions},
isbn = {9783642393501},
issn = {0302-9743},
location = {Las Vegas, USA},
pages = {32--41},
publisher = {Springer Berlin Heidelberg},
title = {{A Taxonomy-Based Approach towards NUI Interaction Design}},
doi = {10.1007/978-3-642-39351-8_4},
volume = {8028},
year = {2013},
}
@inbook{2918,
author = {Kakvi, Saqib and Kiltz, Eike and May, Alexander},
booktitle = {Advances in Cryptology – ASIACRYPT 2012},
isbn = {9783642349607},
issn = {0302-9743},
pages = {404--414},
publisher = {Springer Berlin Heidelberg},
title = {{Certifying RSA}},
doi = {10.1007/978-3-642-34961-4_25},
year = {2012},
}
@inbook{2919,
author = {Kakvi, Saqib and Kiltz, Eike},
booktitle = {Advances in Cryptology – EUROCRYPT 2012},
isbn = {9783642290107},
issn = {0302-9743},
pages = {537--553},
publisher = {Springer Berlin Heidelberg},
title = {{Optimal Security Proofs for Full Domain Hash, Revisited}},
doi = {10.1007/978-3-642-29011-4_32},
year = {2012},
}
@inbook{6293,
author = {Nebe, Karsten and Klompmaker, Florian and Jung, Helge and Fischer, Holger Gerhard},
booktitle = {Human-Computer Interaction. Interaction Techniques and Environments.},
editor = {Jacko, Julie Anne},
isbn = {9783642216046},
issn = {0302-9743},
location = {Orlando, USA},
pages = {100--109},
publisher = {Springer Berlin Heidelberg},
title = {{Exploiting New Interaction Techniques for Disaster Control Management Using Multitouch-, Tangible- and Pen-Based-Interaction}},
doi = {10.1007/978-3-642-21605-3_11},
volume = {6762},
year = {2011},
}
@article{3332,
author = {Lettmann, Theodor and Baumann, Michael and Eberling, Markus and Kemmerich, Thomas},
isbn = {9783642240157},
issn = {0302-9743},
journal = {Transactions on Computational Collective Intelligence V},
pages = {157--181},
publisher = {Springer Berlin Heidelberg},
title = {{Modeling Agents and Agent Systems}},
doi = {10.1007/978-3-642-24016-4_9},
year = {2011},
}
@inbook{6300,
author = {Fischer, Holger Gerhard and Nebe, Karsten and Klompmaker, Florian},
booktitle = {Human Centered Design},
editor = {Kurosu, Masaaki},
isbn = {9783642217524},
issn = {0302-9743},
location = {Orlando, USA},
pages = {28--37},
publisher = {Springer Berlin Heidelberg},
title = {{A Holistic Model for Integrating Usability Engineering and Software Engineering Enriched with Marketing Activities}},
doi = {10.1007/978-3-642-21753-1_4},
volume = {6776},
year = {2011},
}
@inbook{2988,
author = {Ackermann, Marcel R. and Blömer, Johannes},
booktitle = {SWAT 2010},
isbn = {9783642137303},
issn = {0302-9743},
pages = {212--223},
publisher = {Springer Berlin Heidelberg},
title = {{Bregman Clustering for Separable Instances}},
doi = {10.1007/978-3-642-13731-0_21},
year = {2010},
}
@inbook{2920,
author = {Kakvi, Saqib},
booktitle = {Lecture Notes in Computer Science},
isbn = {9783642040511},
issn = {0302-9743},
pages = {300--301},
publisher = {Springer Berlin Heidelberg},
title = {{Reinforcement Learning for Blackjack}},
doi = {10.1007/978-3-642-04052-8_43},
year = {2009},
}
@inbook{3000,
author = {Schrieb, Jonas and Wehrheim, Heike and Wonisch, Daniel},
booktitle = {FM 2009: Formal Methods},
isbn = {9783642050886},
issn = {0302-9743},
pages = {106--122},
publisher = {Springer Berlin Heidelberg},
title = {{Three-Valued Spotlight Abstractions}},
doi = {10.1007/978-3-642-05089-3_8},
year = {2009},
}
@inbook{9616,
author = {Kakvi, Saqib},
booktitle = {Lecture Notes in Computer Science},
isbn = {9783642040511},
issn = {0302-9743},
title = {{Reinforcement Learning for Blackjack}},
doi = {10.1007/978-3-642-04052-8_43},
year = {2009},
}
@inbook{1830,
author = {Biermann, Thorsten and Schwabe, Arne and Karl, Holger},
booktitle = {NETWORKING 2009},
isbn = {9783642013980},
issn = {0302-9743},
pages = {883--894},
publisher = {Springer Berlin Heidelberg},
title = {{Creating Butterflies in the Core – A Network Coding Extension for MPLS/RSVP-TE}},
doi = {10.1007/978-3-642-01399-7_69},
year = {2009},
}
@inbook{3020,
author = {Blömer, Johannes and May, Alexander},
booktitle = {Lecture Notes in Computer Science},
isbn = {9783540424888},
issn = {0302-9743},
pages = {4--19},
publisher = {Springer Berlin Heidelberg},
title = {{Low Secret Exponent RSA Revisited}},
doi = {10.1007/3-540-44670-2_2},
year = {2007},
}
@inbook{3019,
author = {May, Alexander},
booktitle = {Advances in Cryptology — CRYPTO 2002},
isbn = {9783540440505},
issn = {0302-9743},
pages = {242--256},
publisher = {Springer Berlin Heidelberg},
title = {{Cryptanalysis of Unbalanced RSA with Small CRT-Exponent}},
doi = {10.1007/3-540-45708-9_16},
year = {2007},
}
@inbook{3021,
author = {Blömer, Johannes and May, Alexander},
booktitle = {Selected Areas in Cryptography},
isbn = {9783540430667},
issn = {0302-9743},
pages = {325--341},
publisher = {Springer Berlin Heidelberg},
title = {{Key Revocation with Interval Cover Families}},
doi = {10.1007/3-540-45537-x_26},
year = {2007},
}
@inbook{3026,
author = {Blömer, Johannes},
booktitle = {Algorithms — ESA’ 98},
isbn = {9783540648482},
issn = {0302-9743},
pages = {151--162},
publisher = {Springer Berlin Heidelberg},
title = {{A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers}},
doi = {10.1007/3-540-68530-8_13},
year = {2007},
}
@inbook{3022,
author = {May, Alexander and Silverman, Joseph H.},
booktitle = {Lecture Notes in Computer Science},
isbn = {9783540424888},
issn = {0302-9743},
pages = {110--125},
publisher = {Springer Berlin Heidelberg},
title = {{Dimension Reduction Methods for Convolution Modular Lattices}},
doi = {10.1007/3-540-44670-2_10},
year = {2007},
}
@inbook{3004,
author = {Blömer, Johannes and Krummel, Volker},
booktitle = {Lecture Notes in Computer Science},
isbn = {9783540462507},
issn = {0302-9743},
pages = {106--120},
publisher = {Springer Berlin Heidelberg},
title = {{Fault Based Collision Attacks on AES}},
doi = {10.1007/11889700_11},
year = {2006},
}
@inbook{3005,
author = {Blömer, Johannes and Otto, Martin},
booktitle = {Lecture Notes in Computer Science},
isbn = {9783540462507},
issn = {0302-9743},
pages = {13--23},
publisher = {Springer Berlin Heidelberg},
title = {{Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered}},
doi = {10.1007/11889700_2},
year = {2006},
}
@inbook{3007,
author = {Blömer, Johannes and Otto, Martin and Seifert, Jean-Pierre},
booktitle = {Lecture Notes in Computer Science},
isbn = {9783540462507},
issn = {0302-9743},
pages = {36--52},
publisher = {Springer Berlin Heidelberg},
title = {{Sign Change Fault Attacks on Elliptic Curve Cryptosystems}},
doi = {10.1007/11889700_4},
year = {2006},
}
@inbook{3006,
author = {Blömer, Johannes and May, Alexander},
booktitle = {EUROCRYPT 2005},
isbn = {9783540259107},
issn = {0302-9743},
pages = {251--267},
publisher = {Springer Berlin Heidelberg},
title = {{A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers}},
doi = {10.1007/11426639_15},
year = {2005},
}
@inbook{3010,
author = {Ernst, Matthias and Jochemsz, Ellen and May, Alexander and de Weger, Benne},
booktitle = {EUROCRYPT 2005},
isbn = {9783540259107},
issn = {0302-9743},
pages = {371--386},
publisher = {Springer Berlin Heidelberg},
title = {{Partial Key Exposure Attacks on RSA up to Full Size Exponents}},
doi = {10.1007/11426639_22},
year = {2005},
}
@inbook{3011,
author = {Blömer, Johannes and Guajardo, Jorge and Krummel, Volker},
booktitle = {Selected Areas in Cryptography},
isbn = {9783540243274},
issn = {0302-9743},
pages = {69--83},
publisher = {Springer Berlin Heidelberg},
title = {{Provably Secure Masking of AES}},
doi = {10.1007/978-3-540-30564-4_5},
year = {2004},
}
@inbook{3012,
author = {Blömer, Johannes and May, Alexander},
booktitle = {Public Key Cryptography – PKC 2004},
isbn = {9783540210184},
issn = {0302-9743},
pages = {1--13},
publisher = {Springer Berlin Heidelberg},
title = {{A Generalized Wiener Attack on RSA}},
doi = {10.1007/978-3-540-24632-9_1},
year = {2004},
}
@inbook{3014,
author = {May, Alexander},
booktitle = {Public Key Cryptography – PKC 2004},
isbn = {9783540210184},
issn = {0302-9743},
pages = {218--230},
publisher = {Springer Berlin Heidelberg},
title = {{Secret Exponent Attacks on RSA-type Schemes with Moduli N=p^{r}q}},
doi = {10.1007/978-3-540-24632-9_16},
year = {2004},
}
@inbook{3015,
author = {May, Alexander},
booktitle = {Advances in Cryptology – CRYPTO 2004},
isbn = {9783540226680},
issn = {0302-9743},
pages = {213--219},
publisher = {Springer Berlin Heidelberg},
title = {{Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring}},
doi = {10.1007/978-3-540-28628-8_13},
year = {2004},
}
@inbook{3016,
author = {Blömer, Johannes and May, Alexander},
booktitle = {Advances in Cryptology - CRYPTO 2003},
isbn = {9783540406747},
issn = {0302-9743},
pages = {27--43},
publisher = {Springer Berlin Heidelberg},
title = {{New Partial Key Exposure Attacks on RSA}},
doi = {10.1007/978-3-540-45146-4_2},
year = {2003},
}
@inbook{3018,
author = {Blömer, Johannes and Seifert, Jean-Pierre},
booktitle = {Financial Cryptography},
isbn = {9783540406631},
issn = {0302-9743},
pages = {162--181},
publisher = {Springer Berlin Heidelberg},
title = {{Fault Based Cryptanalysis of the Advanced Encryption Standard (AES)}},
doi = {10.1007/978-3-540-45126-6_12},
year = {2003},
}
@inbook{3023,
author = {Blömer, Johannes},
booktitle = {Automata, Languages and Programming},
isbn = {9783540677154},
issn = {0302-9743},
pages = {248--259},
publisher = {Springer Berlin Heidelberg},
title = {{Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices}},
doi = {10.1007/3-540-45022-x_22},
year = {2000},
}
@inbook{2435,
author = {Simon, Jens and Reinefeld, Alexander and Heinz, Oliver},
booktitle = {SCI: Scalable Coherent Interface. Architecture and Software for High-Performance Compute Clusters},
editor = {Hellwagner, Hermann and Reinefeld, Alexander},
isbn = {978-3-540-47048-9},
issn = {0302-9743},
pages = {367--381},
publisher = {Springer},
title = {{Large-Scale SCI Clusters in Practice: Architecture and Performance in SCI}},
doi = {10.1007/10704208},
volume = {1734},
year = {1999},
}
@inbook{3029,
author = {Blömer, Johannes},
booktitle = {Algorithms — ESA '97},
isbn = {9783540633976},
issn = {0302-9743},
pages = {53--63},
publisher = {Springer Berlin Heidelberg},
title = {{Denesting by bounded degree radicals}},
doi = {10.1007/3-540-63397-9_5},
year = {1997},
}
@inbook{3046,
author = {Alt, Helmut and Blömer, Johannes},
booktitle = {Data structures and efficient algorithms},
isbn = {9783540554882},
issn = {0302-9743},
pages = {1--24},
publisher = {Springer Berlin Heidelberg},
title = {{Resemblance and symmetries of geometric patterns}},
doi = {10.1007/3-540-55488-2_19},
year = {1992},
}