Sciweavers

5484 search results - page 1012 / 1097
» Almost-Everywhere Secure Computation
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
USS
2008
15 years 2 months ago
VoteBox: A Tamper-evident, Verifiable Electronic Voting System
Commercial electronic voting systems have experienced many high-profile software, hardware, and usability failures in real elections. While it is tempting to abandon electronic vo...
Daniel Sandler, Kyle Derr, Dan S. Wallach
AUSDM
2008
Springer
225views Data Mining» more  AUSDM 2008»
15 years 1 months ago
Service-independent payload analysis to improve intrusion detection in network traffic
The popularity of computer networks broadens the scope for network attackers and increases the damage these attacks can cause. In this context, Intrusion Detection Systems (IDS) a...
Iñigo Perona, Ibai Gurrutxaga, Olatz Arbela...
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
CRYPTO
2006
Springer
129views Cryptology» more  CRYPTO 2006»
15 years 1 months ago
New Proofs for
HMAC was proved in [3] to be a PRF assuming that (1) the underlying compression function is a PRF, and (2) the iterated hash function is weakly collision-resistant. However, recent...
Mihir Bellare
« Prev « First page 1012 / 1097 Last » Next »