Sciweavers

39 search results - page 8 / 8
» Cryptography In the Bounded Quantum-Storage Model
Sort
View
TCC
2009
Springer
184views Cryptology» more  TCC 2009»
14 years 6 months ago
Secure Arithmetic Computation with No Honest Majority
We study the complexity of securely evaluating arithmetic circuits over finite rings. This question is motivated by natural secure computation tasks. Focusing mainly on the case o...
Yuval Ishai, Manoj Prabhakaran, Amit Sahai
ASIACRYPT
2003
Springer
13 years 11 months ago
Almost Uniform Density of Power Residues and the Provable Security of ESIGN
Abstract. ESIGN is an efficient signature scheme that has been proposed in the early nineties (see [14]). Recently, an effort was made to lay ESIGN on firm foundations, using the...
Tatsuaki Okamoto, Jacques Stern
IANDC
2008
105views more  IANDC 2008»
13 years 6 months ago
Symbolic protocol analysis for monoidal equational theories
We are interested in the design of automated procedures for analyzing the (in)security of cryptographic protocols in the Dolev-Yao model for a bounded number of sessions when we t...
Stéphanie Delaune, Pascal Lafourcade, Denis...
CSE
2009
IEEE
14 years 1 months ago
All Friends Are Not Created Equal: An Interaction Intensity Based Approach to Privacy in Online Social Networks
Recent research identifies a growing privacy problem that exists within Online Social Networks (OSNs). Several studies have shown how easily strangers can extract personal data a...
Lerone Banks, Shyhtsun Felix Wu