Sciweavers

PQCRYPTO
2010
298views Cryptology» more  PQCRYPTO 2010»
14 years 3 months ago
Cryptanalysis of the Niederreiter Public Key Scheme Based on GRS Subcodes
Abstract. In this paper a new structural attack on the McEliece/Niederreiter public key cryptosystem based on subcodes of generalized ReedSolomon codes proposed by Berger and Loidr...
Christian Wieschebrink
PQCRYPTO
2010
187views Cryptology» more  PQCRYPTO 2010»
14 years 3 months ago
Information-Set Decoding for Linear Codes over Fq
The best known non-structural attacks against code-based cryptosystems are based on information-set decoding. Stern’s algorithm and its improvements are well optimized and the co...
Christiane Peters
PKC
2010
Springer
146views Cryptology» more  PKC 2010»
14 years 3 months ago
Groth-Sahai Proofs Revisited
Essam Ghadafi, Nigel P. Smart, Bogdan Warinschi
PKC
2010
Springer
148views Cryptology» more  PKC 2010»
14 years 3 months ago
On the Feasibility of Consistent Computations
In many practical settings, participants are willing to deviate from the protocol only if they remain undetected. Aumann and Lindell introduced a concept of covert adversaries to f...
Sven Laur, Helger Lipmaa
PKC
2010
Springer
177views Cryptology» more  PKC 2010»
14 years 3 months ago
More Constructions of Lossy and Correlation-Secure Trapdoor Functions
We propose new and improved instantiations of lossy trapdoor functions (Peikert and Waters, STOC ’08), and correlation-secure trapdoor functions (Rosen and Segev, TCC ’09). Ou...
David Mandell Freeman, Oded Goldreich, Eike Kiltz,...
PKC
2010
Springer
210views Cryptology» more  PKC 2010»
14 years 3 months ago
Algebraic Cryptanalysis of the PKC'2009 Algebraic Surface Cryptosystem
Abstract. In this paper, we fully break the Algebraic Surface Cryptosystem (ASC for short) proposed at PKC’2009 [3]. This system is based on an unusual problem in multivariate cr...
Jean-Charles Faugère, Pierre-Jean Spaenleha...
PKC
2010
Springer
130views Cryptology» more  PKC 2010»
14 years 3 months ago
Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions
Abstract. This paper describes an extremely efficient squaring operation in the so-called ‘cyclotomic subgroup’ of F× q6 , for q ≡ 1 mod 6. This result arises from consideri...
Robert Granger, Michael Scott
PKC
2010
Springer
150views Cryptology» more  PKC 2010»
14 years 3 months ago
Security of Encryption Schemes in Weakened Random Oracle Models
Liskov proposed several weakened versions of the random oracle model, called weakened random oracle models (WROMs), to capture the vulnerability of ideal compression functions, wh...
Akinori Kawachi, Akira Numayama, Keisuke Tanaka, K...
PKC
2010
Springer
126views Cryptology» more  PKC 2010»
14 years 3 months ago
Multi-query Computationally-Private Information Retrieval with Constant Communication Rate
A fundamental privacy problem in the client-server setting is the retrieval of a record from a database maintained by a server so that the computationally bounded server remains ob...
Jens Groth, Aggelos Kiayias, Helger Lipmaa
PKC
2010
Springer
162views Cryptology» more  PKC 2010»
14 years 3 months ago
Faster Pairing Computations on Curves with High-Degree Twists
Research on efficient pairing implementation has focussed on reducing the loop length and on using high-degree twists. Existence of twists of degree larger than 2 is a very restric...
Craig Costello, Tanja Lange, Michael Naehrig