Sciweavers

1769 search results - page 147 / 354
» Cryptography
Sort
View
131
Voted
STOC
1990
ACM
93views Algorithms» more  STOC 1990»
15 years 7 months ago
Perfect Zero-Knowledge in Constant Rounds
Quadratic residuosity and graph isomorphism are classic problems and the canonical examples of zero-knowledge languages. However, despite much research e ort, all previous zerokno...
Mihir Bellare, Silvio Micali, Rafail Ostrovsky
117
Voted
AAECC
2009
Springer
110views Algorithms» more  AAECC 2009»
15 years 7 months ago
Novel Efficient Certificateless Aggregate Signatures
We propose a new efficient certificateless aggregate signature scheme which has the advantages of both aggregate signatures and certificateless cryptography. The scheme is proven e...
Lei Zhang, Bo Qin, Qianhong Wu, Futai Zhang
PQCRYPTO
2010
298views Cryptology» more  PQCRYPTO 2010»
15 years 7 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
ASIACRYPT
2006
Springer
15 years 7 months ago
On the Equivalence of RSA and Factoring Regarding Generic Ring Algorithms
Abstract. To prove or disprove the computational equivalence of solving the RSA problem and factoring integers is a longstanding open problem in cryptography. This paper provides s...
Gregor Leander, Andy Rupp
137
Voted
EUROCRYPT
2006
Springer
15 years 7 months ago
Polling with Physical Envelopes: A Rigorous Analysis of a Human-Centric Protocol
We propose simple, realistic protocols for polling that allow the responder to plausibly repudiate his response, while at the same time allow accurate statistical analysis of poll ...
Tal Moran, Moni Naor