Sciweavers

2967 search results - page 165 / 594
» Cryptology
Sort
View
ICISC
2009
138views Cryptology» more  ICISC 2009»
15 years 4 months ago
Cryptanalysis of a Message Recognition Protocol by Mashatan and Stinson
At CANS 2008, Mashatan and Stinson suggested a message recognition protocol for ad hoc pervasive networks. The protocol provides a procedure to resynchronize in case of a (possibly...
Madeline González Muñiz, Rainer Stei...
CRYPTOLOGIA
2010
15 years 4 months ago
Secure Electronic Voting - A Framework
Abstract. We describe a single framework in which to view the endto-end-independently-verifiable (E2E) polling-place voting systems with a mixnet back-end. We use the framework to ...
Stefan Popoveniuc, Poorvi L. Vora
CRYPTOLOGIA
2010
15 years 4 months ago
Internet Voting Protocol Based on Improved Implicit Security
This paper presents an improved protocol for Internet voting that allows recasting of ballots to eliminate voting errors, encourages early voting and provides an opportunity for c...
Abhishek Parakh, Subhash Kak
CODCRY
2011
Springer
247views Cryptology» more  CODCRY 2011»
14 years 10 months ago
List Decoding for Binary Goppa Codes
This paper presents a list-decoding algorithm for classical irreducible binary Goppa codes. The algorithm corrects, in polynomial time, approximately n − p n(n − 2t − 2) err...
Daniel J. Bernstein
EUROCRYPT
2011
Springer
14 years 10 months ago
Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
Abstract. NTRUEncrypt, proposed in 1996 by Hostein, Pipher and Silverman, is the fastest known lattice-based encryption scheme. Its moderate key-sizes, excellent asymptotic perfor...
Damien Stehlé, Ron Steinfeld