Sciweavers

3690 search results - page 104 / 738
» Computation with classical sequents
Sort
View
COMPUTER
2002
79views more  COMPUTER 2002»
14 years 9 months ago
A Practical Architecture for Reliable Quantum Computers
wever, by using a simple model of abstract building blocks: quantum bits, gates, and algorithms, and the available implementation technologies--in all their imperfections.7 The bas...
Mark Oskin, Frederic T. Chong, Isaac L. Chuang
EUROCRYPT
2007
Springer
15 years 4 months ago
Secure Computation from Random Error Correcting Codes
Abstract. Secure computation consists of protocols for secure arithmetic: secret values are added and multiplied securely by networked processors. The striking feature of secure co...
Hao Chen, Ronald Cramer, Shafi Goldwasser, Robbert...
WORDS
2003
IEEE
15 years 3 months ago
Improving Dependability of Service Oriented Architectures for Pervasive Computing
Service Oriented Programming - which combines Distributed Object Compunting, Component Based and webbased concepts - has recently emerged as a promising approach to develop dynami...
Domenico Cotroneo, Cristiano di Flora, Stefano Rus...
SIAMCOMP
2008
72views more  SIAMCOMP 2008»
14 years 9 months ago
Plottable Real Number Functions and the Computable Graph Theorem
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...
Vasco Brattka
EUROCRYPT
2009
Springer
15 years 10 months ago
Resettably Secure Computation
Abstract. The notion of resettable zero-knowledge (rZK) was introduced by Canetti, Goldreich, Goldwasser and Micali (FOCS'01) as a strengthening of the classical notion of zer...
Vipul Goyal, Amit Sahai