2 citations · 3 across the 3 of their papers we have counts for
3 papers
cs.CR2009★ 1 cited
A new Protocol for 1-2 Oblivious Transfer
Bjoern Grohmann
A new protocol for 1-2 (String) Oblivious Transfer is proposed. The protocol uses 5 rounds of message exchange.
cs.CR2009★ 2 cited
A New Key-Agreement-Protocol
Bjoern Grohmann
A new 4-pass Key-Agreement Protocol is presented. The security of the protocol mainly relies on the existence of a (polynomial-computable) One-Way-Function and the supposed computa…
math.NT2006
Slim normal Bases and Basefield Transforms
Bjoern Grohmann
In this article, we define the notion of slim (normal) bases and show their existence for various fields. As an application, an algorithm will be given that computes the spectrum o…