Sciweavers

264 search results - page 27 / 53
» Minimal-Latency Secure Function Evaluation
Sort
View
CRYPTO
2000
Springer
110views Cryptology» more  CRYPTO 2000»
14 years 2 months ago
Parallel Reducibility for Information-Theoretically Secure Computation
Secure Function Evaluation (SFE) protocols are very hard to design, and reducibility has been recognized as a highly desirable property of SFE protocols. Informally speaking, reduc...
Yevgeniy Dodis, Silvio Micali
CLUSTER
1999
IEEE
13 years 9 months ago
Experimental measurements and design guidelines for real-time software encryption in multimedia wireless LANs
To secure interactive multimedia applications in wireless LANs WLANs it is pertinent to implement real time cryptographic services. In this paper we evaluate the use of software b...
Aura Ganz, Se Hyun Park, Zvi Ganz
OOPSLA
2010
Springer
13 years 8 months ago
Back to the futures: incremental parallelization of existing sequential runtime systems
Many language implementations, particularly for high-level and scripting languages, are based on carefully honed runtime systems that have an internally sequential execution model...
James Swaine, Kevin Tew, Peter A. Dinda, Robert Br...
IPPS
2010
IEEE
13 years 7 months ago
MMT: Exploiting fine-grained parallelism in dynamic memory management
Dynamic memory management is one of the most expensive but ubiquitous operations in many C/C++ applications. Additional features such as security checks, while desirable, further w...
Devesh Tiwari, Sanghoon Lee, James Tuck, Yan Solih...
IACR
2011
113views more  IACR 2011»
12 years 9 months ago
GNUC: A New Universal Composability Framework
We put forward a framework for the modular design and analysis of multi-party protocols. Our framework is called “GNUC” (with the recursive meaning “GNUC’s Not UC”), alr...
Dennis Hofheinz, Victor Shoup