Sciweavers

2601 search results - page 462 / 521
» Secure Rewarding Schemes
Sort
View
STOC
1995
ACM
107views Algorithms» more  STOC 1995»
15 years 3 months ago
Incremental cryptography and application to virus protection
The goal of incremental cryptography is to design cryptographic algorithms with the property that having applied the algorithm to a document, it is possible to quickly update the ...
Mihir Bellare, Oded Goldreich, Shafi Goldwasser
CISC
2008
Springer
148views Cryptology» more  CISC 2008»
15 years 1 months ago
Publicly Verifiable Privacy-Preserving Group Decryption
Anonymity is one of the main concerns in group-oriented cryptography. However, most efforts, for instance, group signatures and ring signatures, are only made to provide anonymity ...
Bo Qin, Qianhong Wu, Willy Susilo, Yi Mu
75
Voted
CEC
2005
IEEE
15 years 1 months ago
Nonlinear mapping using particle swarm optimisation
Abstract— Nonlinear mapping is an approach of multidimensional scaling where a high-dimensional space is transformed into a lower-dimensional space such that the topological char...
Auralia I. Edwards, Andries Petrus Engelbrecht, Ne...
PKC
2010
Springer
234views Cryptology» more  PKC 2010»
15 years 1 months ago
Solving a 676-Bit Discrete Logarithm Problem in GF(36n)
Abstract. Pairings on elliptic curves over finite fields are crucial for constructing various cryptographic schemes. The T pairing on supersingular curves over GF(3n ) is particula...
Takuya Hayashi, Naoyuki Shinohara, Lihua Wang, Shi...
MASCOTS
2001
15 years 1 months ago
Performance of Finite Field Arithmetic in an Elliptic Curve Cryptosystem
As the Internet commerce becomes a more important part of the economy, network security is receiving more emphasis. Time spent in data encryption can be a significant performance ...
Zhi Li, John Higgins, Mark J. Clement