Sciweavers

53 search results - page 1 / 11
» Constructive homomorphisms for classical groups
Sort
View
JSC
2011
74views more  JSC 2011»
13 years 6 days ago
Constructive homomorphisms for classical groups
Let Ω ≤ GLd(q) be a quasisimple classical group in its natural representation and let ∆ = NGLd(q)(Ω). We construct the projection from ∆ to ∆/Ω and provide fast, poly...
Scott H. Murray, Colva M. Roney-Dougal
STOC
2004
ACM
157views Algorithms» more  STOC 2004»
14 years 5 months ago
Derandomizing homomorphism testing in general groups
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
Amir Shpilka, Avi Wigderson
CRYPTO
2008
Springer
186views Cryptology» more  CRYPTO 2008»
13 years 7 months ago
Communication Complexity in Algebraic Two-Party Protocols
In cryptography, there has been tremendous success in building various two-party protocols with small communication complexity out of homomorphic semantically-secure encryption sc...
Rafail Ostrovsky, William E. Skeith III
IPL
2006
118views more  IPL 2006»
13 years 5 months ago
Easy intruder deduction problems with homomorphisms
We present complexity results for the verification of security protocols. Since the perfect cryptography assumption is unrealistic for cryptographic primitives with visible algebr...
Stéphanie Delaune
TCS
2008
13 years 5 months ago
Seminormal rings (following Thierry Coquand)
The Traverso-Swan theorem says that a reduced ring A is seminormal if and only if the natural homomorphism Pic A Pic A[X] is an isomorphism ([18, 17]). We give here all the detai...
Henri Lombardi, Claude Quitté