Searching for authors named "Endre Bangerter" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

2 documents found, showing 1 through 2.

Efficient proofs of knowledge of discrete logarithms and representations in groups with hidden order
by Endre Bangerter, Jan Camenisch, Ueli Maurer — 2005 — In PKC 2005, LNCS 3386
…Abstract. For many one-way homomorphisms used in cryptography, there exist efficient zeroknowledge proofs of knowledge of a preimage. Examples of such homomorphisms are the ones underlying the Schnorr or the Guillou-Quisquater identification protocols. In this paper we present, for the first time, e…
Cited by 3 (0 self) – Add To MetaCart

Sufficient Conditions for the Computational Intractability of Generic Group Problems
by Gregor Le, Endre Bangerter, Ahmad-reza Sadeghi, Er W. Dent
…Abstract. The generic group model is a valuable methodology for analysing the computational hardness some number-theoretic problems used in cryptography. Although generic hardness proofs exhibit many similarities, still the computational intractability of every newly introduced problem needs to be p…
Add To MetaCart

Showing 1 through 2.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB