Sciweavers

37 search results - page 4 / 8
» Secure Multi-party Computation Minimizing Online Rounds
Sort
View
SIAMCOMP
2012
11 years 8 months ago
Randomized Competitive Algorithms for Generalized Caching
We consider online algorithms for the generalized caching problem. Here we are given a cache of size k and pages with arbitrary sizes and fetching costs. Given a request sequence ...
Nikhil Bansal, Niv Buchbinder, Joseph Naor
JOC
2006
116views more  JOC 2006»
13 years 5 months ago
On the Fly Authentication and Signature Schemes Based on Groups of Unknown Order
Abstract. In response to the current need for fast, secure and cheap public-key cryptography, we propose an interactive zero-knowledge identification scheme and a derived signature...
Marc Girault, Guillaume Poupard, Jacques Stern
ACMICEC
2003
ACM
144views ECommerce» more  ACMICEC 2003»
13 years 11 months ago
Security model for a multi-agent marketplace
A multi-agent marketplace, MAGNET (Multi AGent Negotiation Testbed), is a promising solution to conduct online combinatorial auctions. The trust model of MAGNET is somewhat diffe...
Ashutosh Jaiswal, Yongdae Kim, Maria L. Gini
LOCA
2009
Springer
14 years 9 days ago
LOCK: A Highly Accurate, Easy-to-Use Location-Based Access Control System
With proliferation of ubiquitous computing, digital access is facing an increasing risk since unauthorized client located at any place may intrude a local server. Location Based Ac...
Yongcai Wang, Junhui Zhao, Toshikazu Fukushima
CCS
2009
ACM
14 years 17 days ago
Ripley: automatically securing web 2.0 applications through replicated execution
Rich Internet applications are becoming increasingly distributed, as demonstrated by the popularity of AJAX or Web 2.0 applications such as Facebook, Google Maps, Hotmail and many...
K. Vikram, Abhishek Prateek, V. Benjamin Livshits