Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs
Author:
- 21 August 2017
- journal article
- research article
- Published by Springer Nature in Journal of Cryptology
- Vol. 31 (2) , 537-586
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Outsourced Pattern Matching2013
- Efficient Set Operations in the Presence of Malicious AdversariesJournal of Cryptology, 2011
- (If) Size Matters: Size-Hiding Private Set Intersection2011
- A generalization of Paillier’s public-key system with applications to electronic votingInternational Journal of Information Security, 2010
- Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert AdversariesJournal of Cryptology, 2008
- Oblivious Polynomial EvaluationSIAM Journal on Computing, 2006
- Oblivious polynomial evaluation and oblivious neural learningTheoretical Computer Science, 2005
- Security and Composition of Multiparty Cryptographic ProtocolsJournal of Cryptology, 2000
- Balanced AllocationsSIAM Journal on Computing, 1999
- A public key cryptosystem and a signature scheme based on discrete logarithmsIEEE Transactions on Information Theory, 1985