Advances in Cryptology - EUROCRYPT 2004

DOI10.1007/b97182zbMath1122.68422OpenAlexW2477185671WikidataQ21683979 ScholiaQ21683979MaRDI QIDQ5307245

Benny Pinkas, Gagan Aggarwal, Nina Mishra

Publication date: 25 September 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b97182

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Related Items (13)

Rate-limited secure function evaluation ⋮ Privacy-preserving naive Bayes classifiers secure against the substitution-then-comparison attack ⋮ Dividing secrets to secure data outsourcing ⋮ Efficient set operations in the presence of malicious adversaries ⋮ Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries ⋮ Privacy Preserving Data Mining within Anonymous Credential Systems ⋮ Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs ⋮ Scalable Multi-party Private Set-Intersection ⋮ Fast Private Norm Estimation and Heavy Hitters ⋮ \(k\)-anonymous data collection ⋮ Efficient Fully-Simulatable Oblivious Transfer ⋮ Computationally secure pattern matching in the presence of malicious adversaries ⋮ An efficient protocol for secure two-party computation in the presence of malicious adversaries

This page was built for publication: Advances in Cryptology - EUROCRYPT 2004