Sciweavers

1597 search results - page 152 / 320
» Mental Models of Computer Security
Sort
View
CRYPTO
1989
Springer
163views Cryptology» more  CRYPTO 1989»
15 years 8 months ago
Undeniable Signatures
Abstract. In this paper, we provide a new approach to study undeniable signatures by translating secure digital signatures to secure undeniable signatures so that the existing algo...
David Chaum, Hans Van Antwerpen
CISC
2007
Springer
129views Cryptology» more  CISC 2007»
15 years 8 months ago
Efficient Public Key Encryption with Keyword Search Schemes from Pairings
Public key encryption with keyword search (PEKS) enables user Alice to send a secret key TW to a server that will enable the server to locate all encrypted messages containing the...
Chunxiang Gu, Yuefei Zhu, Heng Pan
IJNSEC
2010
128views more  IJNSEC 2010»
14 years 11 months ago
New Efficient Searchable Encryption Schemes from Bilinear Pairings
Public key encryption with keyword search (PEKS) enables user Alice to send a secret key TW to a server that will enable the server to locate all encrypted messages containing the...
Chunxiang Gu, Yuefei Zhu
CCS
2010
ACM
15 years 4 months ago
In search of an anonymous and secure lookup: attacks on structured peer-to-peer anonymous communication systems
The ability to locate random relays is a key challenge for peer-to-peer (P2P) anonymous communication systems. Earlier attempts like Salsa and AP3 used distributed hash table look...
Qiyan Wang, Prateek Mittal, Nikita Borisov
SP
1998
IEEE
173views Security Privacy» more  SP 1998»
15 years 8 months ago
An Automated Approach for Identifying Potential Vulnerabilities in Software
This paper presents results from analyzing the vulnerability of security-critical software applications to malicious threats and anomalous events using an automated fault injectio...
Anup K. Ghosh, Tom O'Connor, Gary McGraw