Sciweavers

222 search results - page 25 / 45
» How to Forget a Secret
Sort
View
IICAI
2007
14 years 11 months ago
Logics for Action
Logics of action, for reasoning about the effects of state change, and logics of belief, accounting for belief revision and update, have much in common. Furthermore, we may underta...
Michael P. Fourman
ANLP
1994
155views more  ANLP 1994»
14 years 11 months ago
Guided Sentences Composition for Disabled People
We present the advantages of guided sentences composition for communicating in natural language with computers. We show how guidance can be achieved by means of the partial synthe...
Robert Pasero, Nathalie Richardet, Paul Sabatier
87
Voted
IJSSE
2010
80views more  IJSSE 2010»
14 years 7 months ago
Improving Memory Management Security for C and C++
Memory managers are an important part of any modern language: they are used to dynamically allocate memory for use in the program. Many managers exist and depending on the operati...
Yves Younan, Wouter Joosen, Frank Piessens, Hans V...
STOC
2002
ACM
130views Algorithms» more  STOC 2002»
15 years 10 months ago
Secure multi-party quantum computation
Secure multi-party computing, also called secure function evaluation, has been extensively studied in classical cryptography. We consider the extension of this task to computation...
Claude Crépeau, Daniel Gottesman, Adam Smit...
81
Voted
DCC
2009
IEEE
15 years 5 months ago
On Compression of Data Encrypted with Block Ciphers
This paper investigates compression of encrypted data. It has been previously shown that data encrypted with Vernam’s scheme [1], also known as the one-time pad, can be compress...
Demijan Klinc, Carmit Hazay, Ashish Jagmohan, Hugo...