Sciweavers

2967 search results - page 190 / 594
» Cryptology
Sort
View
EUROCRYPT
1990
Springer
15 years 11 months ago
A Known Plaintext Attack on Two-Key Triple Encryption
A chosen-plaintext attack on two-key triple encryption noted by Merkle and Hellman is extended to a known-plaintext attack. The known-plaintext attack has lower memory requirements...
Paul C. van Oorschot, Michael J. Wiener
ACNS
2009
Springer
118views Cryptology» more  ACNS 2009»
15 years 11 months ago
Efficient Robust Private Set Intersection
Computing Set Intersection privately and efficiently between two mutually mistrusting parties is an important basic procedure in the area of private data mining. Assuring robustnes...
Dana Dachman-Soled, Tal Malkin, Mariana Raykova, M...
CISC
2007
Springer
117views Cryptology» more  CISC 2007»
15 years 11 months ago
An Efficient ID-Based Proxy Signature Scheme from Pairings
This paper proposes a new ID-based proxy signature scheme based on the bilinear pairings. The number of paring operation involved in the verification procedure of our scheme is onl...
Chunxiang Gu, Yuefei Zhu
PQCRYPTO
2010
298views Cryptology» more  PQCRYPTO 2010»
15 years 11 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
CRYPTO
2007
Springer
93views Cryptology» more  CRYPTO 2007»
15 years 11 months ago
How Many Oblivious Transfers Are Needed for Secure Multiparty Computation?
Oblivious transfer (OT) is an essential building block for secure multiparty computation when there is no honest majority. In this setting, current protocols for n 3 parties requ...
Danny Harnik, Yuval Ishai, Eyal Kushilevitz