Sciweavers

729 search results - page 128 / 146
» Communicating Evolving Algebras
Sort
View
EUROCRYPT
2007
Springer
14 years 1 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...
MMB
2010
Springer
194views Communications» more  MMB 2010»
14 years 8 days ago
Searching for Tight Performance Bounds in Feed-Forward Networks
Abstract. Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently...
Andreas Kiefer, Nicos Gollan, Jens B. Schmitt
FM
2006
Springer
153views Formal Methods» more  FM 2006»
13 years 11 months ago
Formal Methods and Cryptography
Security-critical systems are an important application area for formal methods. However, such systems often contain cryptographic subsystems. The natural definitions of these subsy...
Michael Backes, Birgit Pfitzmann, Michael Waidner
ECCC
2006
120views more  ECCC 2006»
13 years 7 months ago
New Locally Decodable Codes and Private Information Retrieval Schemes
A q query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only...
Sergey Yekhanin
JUCS
2008
186views more  JUCS 2008»
13 years 7 months ago
A Safe Dynamic Adaptation Framework for Aspect-Oriented Software Development
: One focus of current software development is the re-use of components in the construction of systems. Software Adaptation facilitates the consequent need to adapt these component...
Miguel Ángel Pérez Toledano, Amparo ...