Sciweavers

212 search results - page 38 / 43
» Universally Composable Commitments
Sort
View
FOCS
2007
IEEE
14 years 2 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...
TPDS
2010
185views more  TPDS 2010»
13 years 6 months ago
All-Pairs: An Abstraction for Data-Intensive Computing on Campus Grids
s: An Abstraction for Data Intensive Computing on Campus Grids Christopher Moretti, Hoang Bui, Karen Hollingsworth, Brandon Rich, Patrick Flynn, and Douglas Thain Department of Com...
Christopher Moretti, Hoang Bui, Karen Hollingswort...
BMCBI
2010
137views more  BMCBI 2010»
13 years 2 months ago
The ancient history of the structure of ribonuclease P and the early origins of Archaea
Background: Ribonuclease P is an ancient endonuclease that cleaves precursor tRNA and generally consists of a catalytic RNA subunit (RPR) and one or more proteins (RPPs). It repre...
Feng-Jie Sun, Gustavo Caetano-Anollés
TCC
2009
Springer
255views Cryptology» more  TCC 2009»
14 years 8 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»
14 years 2 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