31 search results - page 6 / 7 » Efficient Fully-Simulatable Oblivious Transfer |
STOC
2003
ACM
14 years 8 months ago
2003
ACM
We consider non-malleable (NM) and universally composable (UC) commitment schemes in the common reference string (CRS) model. We show how to construct non-interactive NM commitmen...
CRYPTO
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. In this work, we introduce one-time programs, a new computational paradigm geared towards security applications. A one-time program can be executed on a single input, who...
ICISC
2008
13 years 10 months ago
2008
Secure Evaluation of Private Functions (PF-SFE) allows two parties to compute a private function which is known by one party only on private data of both. It is known that PF-SFE c...
CHES
2010
Springer
13 years 9 months ago
2010
Springer
The power of side-channel leakage attacks on cryptographic implementations is evident. Today's practical defenses are typically attack-specific countermeasures against certain...
CRYPTO
2006
Springer
14 years 6 days ago
2006
Springer
Abstract. Let A and B denote cryptographic primitives. A (k, m)robust A-to-B combiner is a construction, which takes m implementations of primitive A as input, and yields an implem...