Sciweavers

157 search results - page 27 / 32
» A Universally Composable Mix-Net
Sort
View
75
Voted
ESORICS
2006
Springer
15 years 1 months ago
Conditional Reactive Simulatability
Abstract. Simulatability has established itself as a salient notion for defining and proving the security of cryptographic protocols since it entails strong security and compositio...
Michael Backes, Markus Dürmuth, Dennis Hofhei...
CVPR
2009
IEEE
16 years 4 months ago
Topology Dictionary with Markov Model for 3D Video Content-Based Skimming and Description
This paper presents a novel approach to skim and describe 3D videos. 3D video is an imaging technology which consists in a stream of 3D models in motion captured by a synchronized ...
Tony Tung (Kyoto University), Takashi Matsuyama (K...
77
Voted
FOCS
2007
IEEE
15 years 4 months ago
The Power of Quantum Systems on a Line
: We study the computational strength of quantum particles (each of finite dimensionality) arranged on a line. First, we prove that it is possible to perform universal adiabatic q...
Dorit Aharonov, Daniel Gottesman, Sandy Irani, Jul...
TCC
2009
Springer
255views Cryptology» more  TCC 2009»
15 years 10 months ago
LEGO for Two-Party Secure Computation
The first and still most popular solution for secure two-party computation relies on Yao's garbled circuits. Unfortunately, Yao's construction provide security only again...
Jesper Buus Nielsen, Claudio Orlandi
ACNS
2009
Springer
123views Cryptology» more  ACNS 2009»
15 years 4 months ago
Practical Secure Evaluation of Semi-private Functions
Abstract. Two-party Secure Function Evaluation (SFE) is a very useful cryptographic tool which allows two parties to evaluate a function known to both parties on their private (sec...
Annika Paus, Ahmad-Reza Sadeghi, Thomas Schneider