The following pages link to Ido Shahaf (Q1631323):
Displaying 10 items.
- Ciphertext expansion in limited-leakage order-preserving encryption: a tight computational lower bound (Q1631324) (← links)
- Strengthening the security of encrypted databases: non-transitive JOINs (Q1690288) (← links)
- Generic-group delay functions require hidden-order groups (Q2055651) (← links)
- Searchable Symmetric Encryption: Optimal Locality in Linear Space via Two-Dimensional Balanced Allocations (Q5157397) (← links)
- Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations (Q5361905) (← links)
- Tight tradeoffs in searchable symmetric encryption (Q5915726) (← links)
- Can PPAD hardness be based on standard cryptographic assumptions? (Q5915839) (← links)
- Can PPAD hardness be based on standard cryptographic assumptions? (Q5925502) (← links)
- Tight tradeoffs in searchable symmetric encryption (Q5925503) (← links)
- (Q6059369) (← links)
