Markus Hinkelmann
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Markus Hinkelmann has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Andreas Jakoby
Institut für Theoretische Informatik, Universität zu Lübeck, Ratzeburger Allee 160, 23538 Lübeck, Germany
2 shared publications Andreas Jakoby
Universität zu Lübeck, Germany
1 shared publicationNina Moebius
Universitat Augsburg, Germany
1 shared publicationPeer Stechert
RBZ Technik Kiel, Germany
1 shared publication- Peer Stechert
Universität Siegen
1 shared publication Tiark Rompf
Ecole Polytechnique Fédérale de Lausanne (EPFL), Switzerland
1 shared publication
Latest Publications
- 7 December 2010
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 23 (12) , 1399-1413
A cryptographicallyt‐private auction system
We present a cryptographicallyt‐private protocol for electronic auctions whose low resource demands make it viable for practical use. Our construction is based on Yao's garbled circuits and pseudorandom number generators (PRNGs). Our protocol involves a field of (t+ 1)2parties for the generation of the garbled circuit and permits an arbitrary large number of bidders. The computational requirements are low: Onlyt+ 1 parties of the field have to use the PRNG, the remaining parties execute only primitive computations (XOR, permutations and sharing). The bidders have to stay active for one round of communication, independent of each other. Each bidder has to compute onlyt+ 1 XOR‐operations. We present an implementation and evaluate its performance. The observed running time of our protocol is linear in the size of the auction circuit and the number of bidders and, as expected, grows quadratically in the parametert. Copyright © 2010 John Wiley & Sons, Ltd.
- 7 December 2010
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 23 (12) , 1399-1413
A cryptographicallyt‐private auction system
We present a cryptographicallyt‐private protocol for electronic auctions whose low resource demands make it viable for practical use. Our construction is based on Yao's garbled circuits and pseudorandom number generators (PRNGs). Our protocol involves a field of (t+ 1)2parties for the generation of the garbled circuit and permits an arbitrary large number of bidders. The computational requirements are low: Onlyt+ 1 parties of the field have to use the PRNG, the remaining parties execute only primitive computations (XOR, permutations and sharing). The bidders have to stay active for one round of communication, independent of each other. Each bidder has to compute onlyt+ 1 XOR‐operations. We present an implementation and evaluate its performance. The observed running time of our protocol is linear in the size of the auction circuit and the number of bidders and, as expected, grows quadratically in the parametert. Copyright © 2010 John Wiley & Sons, Ltd.
- 1 September 2008
- Published by Springer Nature in Journal of Computer Science and Technology
- Vol. 23 (5) , 694-710
t-Private and t-Secure Auctions
- 1 September 2008
- Published by Springer Nature in Journal of Computer Science and Technology
- Vol. 23 (5) , 694-710
t-Private and t-Secure Auctions
- 1 October 2007
- Published by Elsevier in Theoretical Computer Science
- Vol. 384 (2-3) , 184-200
Communications in unknown networks: Preserving the secret of topology
- 1 October 2007
- Published by Elsevier in Theoretical Computer Science
- Vol. 384 (2-3) , 184-200
Communications in unknown networks: Preserving the secret of topology