Oblivious

Results: 327



#Item
201Routing / Routing protocols / Internet / Routing algorithms / Computing / Network performance / Network architecture / Throughput

Worst-case Traffic for Oblivious Routing Functions Brian Towles and William J. Dally Department of Electrical Engineering Stanford University {btowles,billd}@cva.stanford.edu Abstract— This paper presents an algorithm

Add to Reading List

Source URL: cva.stanford.edu

Language: English - Date: 2005-12-01 13:38:04
202Oblivious transfer / Decisional Diffie–Hellman assumption / Commitment scheme / Secure multi-party computation / Communications protocol / Zero-knowledge proof / Proof of knowledge / Cryptography / Cryptographic protocols / Universal composability

Efficient Fully-Simulatable Oblivious Transfer∗ Yehuda Lindell† Department of Computer Science Bar-Ilan University, Israel.

Add to Reading List

Source URL: cjtcs.cs.uchicago.edu

Language: English - Date: 2008-12-21 16:22:00
203XTR / Oblivious transfer / Factorial / BLAKE / Bit array / Cryptography / Cryptographic protocols / Private information retrieval

The Computational Complexity Column by Lance Fortnow Department of Computer Science, University of Chicago 1100 East 58th St., Chicago, ILUSA

Add to Reading List

Source URL: crypto.stanford.edu

Language: English - Date: 2004-11-08 14:06:44
204CPU cache / Dynamic random-access memory / Oram / Cache / Computer data storage / B-tree / Random-access memory / Computer memory / Computer hardware / Computing

Freecursive ORAM: [Nearly] Free Recursion and Integrity Verification for Position-based Oblivious RAM Christopher W. Fletcher† , Ling Ren† , Albert Kwon† , Marten van Dijk‡ , Srinivas Devadas† † Massachusetts

Add to Reading List

Source URL: people.csail.mit.edu

Language: English - Date: 2015-02-02 12:49:08
205Oblivious transfer / ID-based encryption / Universal composability / Communications protocol / Cryptographic protocols / Data / Information

Cryptography for Secure and Private Databases: Enabling Practical Data Access without Compromising Privacy by Matthew Daniel Green

Add to Reading List

Source URL: spar.isi.jhu.edu

Language: English - Date: 2010-02-27 17:25:11
206Computer hardware / Compiler optimizations / CPU cache / Central processing unit / Data / Memory hierarchy / Cache-oblivious algorithm / Loop tiling / Cache / Computer memory / Computing

The Cache Performance of Blocked Monica S. Lam,

Add to Reading List

Source URL: www-suif.stanford.edu

Language: English - Date: 2003-10-16 22:29:20
207Mathematical optimization / Submodular set function / Operations research / Convex optimization / Matroid / Linear programming / Greedy algorithm / Algorithm / Greedoid / Mathematics / Matroid theory / Combinatorics

Monotone Submodular Maximization over a Matroid via Non-Oblivious Local Search Yuval Filmus∗ and Justin Ward† December 30, 2013 Abstract

Add to Reading List

Source URL: www.cs.toronto.edu

Language: English - Date: 2013-12-30 15:39:21
208Oblivious transfer / Zero-knowledge proof / Proof of knowledge / Universal composability / Communications protocol / Public-key cryptography / RSA / XTR / Blind signature / Cryptography / Cryptographic protocols / Commitment scheme

Universally Composable Adaptive Oblivious Transfer Matthew Green Susan Hohenberger Johns Hopkins University

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2013-09-14 17:22:59
209Public-key cryptography / Internet privacy / Alice and Bob / Simple Mail Transfer Protocol / Oblivious transfer / Pretty Good Privacy / Needham–Schroeder protocol / Index of cryptography articles / Cryptography / Email / Cryptographic protocols

A Certified E-Mail Protocol Bruce Schneier Counterpane Systems James Riordan

Add to Reading List

Source URL: www.schneier.com

Language: English - Date: 2014-03-02 23:18:30
210Submodular set function / Order theory / Matroid / Linear programming / Greedy algorithm / XTR / Monotonic function / Greedoid / Ordinal optimization / Mathematics / Mathematical analysis / Matroid theory

Monotone Submodular Maximization over a Matroid via Non-Oblivious Local Search Yuval Filmus and Justin Ward November 25, 2012 Abstract We present an optimal, combinatorial 1 − 1/e approximation algorithm for monotone s

Add to Reading List

Source URL: www.cs.toronto.edu

Language: English - Date: 2012-11-25 12:04:59
UPDATE