Sciweavers

5476 search results - page 129 / 1096
» Resettably Secure Computation
Sort
View
152
Voted
EUROCRYPT
2007
Springer
15 years 8 months ago
Revisiting the Efficiency of Malicious Two-Party Computation
In a recent paper Mohassel and Franklin study the efficiency of secure two-party computation in the presence of malicious behavior. Their aim is to make classical solutions to this...
David P. Woodruff
CSFW
2007
IEEE
15 years 10 months ago
Approximated Computationally Bounded Simulation Relations for Probabilistic Automata
We study simulation relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation lengths are polynomially bounded. T...
Roberto Segala, Andrea Turrini
FSTTCS
2007
Springer
15 years 10 months ago
Computationally Sound Typing for Non-interference: The Case of Deterministic Encryption
Type systems for secure information flow aim to prevent a program from leaking information from variables that hold secret data to variables that hold public data. In this work we...
Judicaël Courant, Cristian Ene, Yassine Lakhn...
ASIACRYPT
2008
Springer
15 years 6 months ago
Towards Robust Computation on Encrypted Data
Encryption schemes that support computation on encrypted data are useful in constructing efficient and intuitively simple cryptographic protocols. However, the approach was previo...
Manoj Prabhakaran, Mike Rosulek