Sciweavers

6164 search results - page 229 / 1233
» Teaching Computer Security
Sort
View
FSTTCS
2006
Springer
15 years 10 months ago
Computationally Sound Symbolic Secrecy in the Presence of Hash Functions
The standard symbolic, deducibility-based notions of secrecy are in general insufficient from a cryptographic point of view, especially in presence of hash functions. In this paper...
Véronique Cortier, Steve Kremer, Ralf K&uum...
IEEEARES
2008
IEEE
16 years 1 months ago
Application-Oriented Trust in Distributed Computing
Preserving integrity of applications being executed in remote machines is an open problem. Integrity requires that application code is not tampered with, prior to or during execut...
Riccardo Scandariato, Yoram Ofek, Paolo Falcarin, ...
SCAM
2005
IEEE
16 years 5 days ago
Static Analysis for Computing Escapability and Mutability for Java Components
A common theme in information security is protection of trusted software components against unauthorized access by untrusted users. In the context of distributed object technologi...
Aiwu Shi, Gleb Naumovich
INFORMATICALT
2010
102views more  INFORMATICALT 2010»
15 years 3 months ago
An Computation-Efficient Generalized Group-Oriented Cryptosystem
A Group-Oriented Cryptosystem (GOC) allows a sender to encrypt a message sent to a group of users so only the specified sets of users in that group can cooperatively decrypt the me...
Ting-Yi Chang
EUROCRYPT
2006
Springer
15 years 10 months ago
Efficient Binary Conversion for Paillier Encrypted Values
We consider the framework of secure n-party computation based on threshold homomorphic cryptosystems as put forth by Cramer,
Berry Schoenmakers, Pim Tuyls