No abstract available.
Cited By
- Nargis I Efficient Oblivious Transfer for One-Sided Active Adaptive Adversaries Progress in Cryptology - AFRICACRYPT 2024, (123-148)
- Yu X, Tang D, Zhao Z and Zhao W (2024). Privacy-preserving compromised credential checking protocol for account protection, Computer Standards & Interfaces, 89:C, Online publication date: 1-Apr-2024.
- Yu X, Tang D, Zhao Z and Zhao W (2024). Parallel private information retrieval protocol with index anonymity for untrusted databases, Journal of King Saud University - Computer and Information Sciences, 36:2, Online publication date: 1-Feb-2024.
- Asharov G, Hamada K, Ikarashi D, Kikuchi R, Nof A, Pinkas B, Takahashi K and Tomida J Efficient Secure Three-Party Sorting with Applications to Data Analysis and Heavy Hitters Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, (125-138)
- Dalskov A, Escudero D and Nof A Fast Fully Secure Multi-Party Computation over Any Ring with Two-Thirds Honest Majority Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, (653-666)
- Ciampi M, Orsini E and Siniscalchi L Four-Round Black-Box Non-malleable Schemes from One-Way Permutations Theory of Cryptography, (300-329)
- Hirahara S and Nanashima M Finding errorless pessiland in error-prone heuristica Proceedings of the 37th Computational Complexity Conference, (1-28)
- Arenas M, Bingol M, Demirci H, Fotiadis G and Lenzini G A Secure Authentication Protocol for Cholesteric Spherical Reflectors Using Homomorphic Encryption Progress in Cryptology - AFRICACRYPT 2022, (425-447)
- Böhler J and Kerschbaum F Secure Multi-party Computation of Differentially Private Heavy Hitters Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security, (2361-2377)
- Malekzadeh M, Borovykh A and Gündüz D Honest-but-Curious Nets: Sensitive Attributes of Private Inputs Can Be Secretly Coded into the Classifiers' Outputs Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security, (825-844)
- Fang W, Zhao D, Tan J, Chen C, Yu C, Wang L, Wang L, Zhou J and Zhang B Large-scale Secure XGB for Vertical Federated Learning Proceedings of the 30th ACM International Conference on Information & Knowledge Management, (443-452)
- Chen C, Zhou J, Wang L, Wu X, Fang W, Tan J, Wang L, Liu A, Wang H and Hong C When Homomorphic Encryption Marries Secret Sharing: Secure Large-Scale Sparse Logistic Regression and Applications in Risk Control Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining, (2652-2662)
- Liu P, Liu K, Fu T, Zhang Y and Hu J (2021). A privacy-preserving resource trading scheme for Cloud Manufacturing with edge-PLCs in IIoT, Journal of Systems Architecture: the EUROMICRO Journal, 117:C, Online publication date: 1-Aug-2021.
- Dwork C, Kim M, Reingold O, Rothblum G and Yona G Outcome indistinguishability Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, (1095-1108)
- Wang C, Bater J, Nayak K and Machanavajjhala A DP-Sync: Hiding Update Patterns in Secure Outsourced Databases with Differential Privacy Proceedings of the 2021 International Conference on Management of Data, (1892-1905)
- Yang Z, Yin C, Jin C, Ning J and Zhou J Lightweight Delegated Authentication with Identity Fraud Detection for Cyber-physical Systems Proceedings of the 7th ACM on Cyber-Physical System Security Workshop, (17-28)
- Hiwatashi K, Ogura K, Ohata S and Nuida K Accelerating Secure (2+1)-Party Computation by Insecure but Efficient Building Blocks Proceedings of the 2021 ACM Asia Conference on Computer and Communications Security, (616-627)
- Fischlin M and Rohrbach F Single-to-Multi-theorem Transformations for Non-interactive Statistical Zero-Knowledge Public-Key Cryptography – PKC 2021, (205-234)
- Viola E (2021). AC0 Unpredictability, ACM Transactions on Computation Theory, 13:1, (1-8), Online publication date: 1-Mar-2021.
- Garay J, Kiayias A and Panagiotakos G Blockchains from Non-idealized Hash Functions Theory of Cryptography, (291-321)
- Seker O, Berndt S, Wilke L and Eisenbarth T SNI-in-the-head: Protecting MPC-in-the-head Protocols against Side-channel Analysis Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, (1033-1049)
- Tueno A and Kerschbaum F Efficient Secure Computation of Order-Preserving Encryption Proceedings of the 15th ACM Asia Conference on Computer and Communications Security, (193-207)
- Chen Y, Ma X, Tang C and Au M PGC: Decentralized Confidential Payment System with Auditability Computer Security – ESORICS 2020, (591-610)
- Boemer F, Cammarota R, Demmler D, Schneider T and Yalame H MP2ML Proceedings of the 15th International Conference on Availability, Reliability and Security, (1-10)
- Ferreira M and Weinberg S Credible, Truthful, and Two-Round (Optimal) Auctions via Cryptographic Commitments Proceedings of the 21st ACM Conference on Economics and Computation, (683-712)
- Bangalore L, Choudhury A and Patra A (2020). The Power of Shunning, Journal of the ACM, 67:3, (1-59), Online publication date: 30-Jun-2020.
- Golovnev A, Guo S, Horel T, Park S and Vaikuntanathan V Data structures meet cryptography: 3SUM with preprocessing Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, (294-307)
- Corrigan-Gibbs H and Kogan D The Function-Inversion Problem: Barriers and Opportunities Theory of Cryptography, (393-421)
- Bernstein D, Hülsing A, Kölbl S, Niederhagen R, Rijneveld J and Schwabe P The SPHINCS+ Signature Framework Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, (2129-2146)
- Ning J, Poh G, Loh J, Chia J and Chang E PrivDPI Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, (1657-1670)
- Agrawal N, Shahin Shamsabadi A, Kusner M and Gascón A QUOTIENT Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, (1231-1247)
- Schoppmann P, Gascón A, Raykova M and Pinkas B Make Some ROOM for the Zeros Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, (1335-1350)
- Radian R and Sattath O Semi-Quantum Money Proceedings of the 1st ACM Conference on Advances in Financial Technologies, (132-146)
- Karakoç F, Nateghizad M and Erkin Z SET-OT Proceedings of the 14th International Conference on Availability, Reliability and Security, (1-9)
- Halpern J and Pass R (2019). Sequential Equilibrium in Computational Games, ACM Transactions on Economics and Computation, 7:2, (1-19), Online publication date: 1-Aug-2019.
- Rao F, Cao J, Bertino E and Kantarcioglu M (2019). Hybrid Private Record Linkage, ACM Transactions on Privacy and Security, 22:3, (1-36), Online publication date: 19-Jul-2019.
- Lin Z, Lu W and Xu S (2019). Unified Preventive and Reactive Cyber Defense Dynamics Is Still Globally Convergent, IEEE/ACM Transactions on Networking, 27:3, (1098-1111), Online publication date: 1-Jun-2019.
- Alexandru A and Pappas G Encrypted LQG using labeled homomorphic encryption Proceedings of the 10th ACM/IEEE International Conference on Cyber-Physical Systems, (129-140)
- Fuchsbauer G, Hanser C and Slamanig D (2019). Structure-Preserving Signatures on Equivalence Classes and Constant-Size Anonymous Credentials, Journal of Cryptology, 32:2, (498-546), Online publication date: 1-Apr-2019.
- Volgushev N, Schwarzkopf M, Getchell B, Varia M, Lapets A and Bestavros A Conclave Proceedings of the Fourteenth EuroSys Conference 2019, (1-18)
- Abraham I, Dolev D and Halpern J (2019). Distributed Protocols for Leader Election, ACM Transactions on Economics and Computation, 7:1, (1-26), Online publication date: 23-Feb-2019.
- Bangalore L, Choudhury A and Garimella G Round efficient computationally secure multi-party computation revisited Proceedings of the 20th International Conference on Distributed Computing and Networking, (292-301)
- Bitansky N and Vaikuntanathan V (2018). Indistinguishability Obfuscation from Functional Encryption, Journal of the ACM, 65:6, (1-37), Online publication date: 26-Nov-2018.
- Dziembowski S, Eckey L and Faust S FairSwap Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, (967-984)
- Dziembowski S, Faust S and Hostáková K General State Channel Networks Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, (949-966)
- Byali M, Joseph A, Patra A and Ravi D Fast Secure Computation for Small Population over the Internet Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, (677-694)
- Hofheinz D, Müller-Quade J and Unruh D (2018). On the (Im-)Possibility of Extending Coin Toss, Journal of Cryptology, 31:4, (1120-1163), Online publication date: 1-Oct-2018.
- Asharov G and Segev G (2018). On Constructing One-Way Permutations from Indistinguishability Obfuscation, Journal of Cryptology, 31:3, (698-736), Online publication date: 1-Jul-2018.
- Geihs M, Karvelas N, Katzenbeisser S and Buchmann J PROPYLA Proceedings of the 6th International Workshop on Security in Cloud Computing, (39-48)
- Demertzis I, Papadopoulos S, Papapetrou O, Deligiannakis A, Garofalakis M and Papamanthou C (2018). Practical Private Range Search in Depth, ACM Transactions on Database Systems, 43:1, (1-52), Online publication date: 11-Apr-2018.
- Wu F, Zilberstein S and Chen X Privacy-preserving policy iteration for decentralized POMDPs Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence and Thirtieth Innovative Applications of Artificial Intelligence Conference and Eighth AAAI Symposium on Educational Advances in Artificial Intelligence, (4759-4766)
- Férée H, Hym S, Mayero M, Moyen J and Nowak D Formal proof of polynomial-time complexity with quasi-interpretations Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs, (146-157)
- Fenske E, Mani A, Johnson A and Sherr M Distributed Measurement with Private Set-Union Cardinality Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, (2295-2312)
- He X, Machanavajjhala A, Flynn C and Srivastava D Composing Differential Privacy and Secure Computation Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, (1389-1406)
- Li Y and Schäge S No-Match Attacks and Robust Partnering Definitions Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, (1343-1360)
- Wang X, Ranellucci S and Katz J Global-Scale Secure Multiparty Computation Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, (39-56)
- Bitansky N, Canetti R, Chiesa A, Goldwasser S, Lin H, Rubinstein A and Tromer E (2017). The Hunting of the SNARK, Journal of Cryptology, 30:4, (989-1066), Online publication date: 1-Oct-2017.
- Oliveira I and Santhanam R Conspiracies between learning algorithms, circuit lower bounds, and pseudorandomness Proceedings of the 32nd Computational Complexity Conference, (1-49)
- HubáăźEk P, Naor M and Ullman J (2016). When Can Limited Randomness Be Used in Repeated Games?, Theory of Computing Systems, 59:4, (722-746), Online publication date: 1-Nov-2016.
- Nanni M, Trasarti R, Monreale A, Grossi V and Pedreschi D (2016). Driving Profiles Computation and Monitoring for Car Insurance CRM, ACM Transactions on Intelligent Systems and Technology, 8:1, (1-26), Online publication date: 3-Oct-2016.
- Halpern J, Pass R and Seeman L Computational Extensive-Form Games Proceedings of the 2016 ACM Conference on Economics and Computation, (681-698)
- Demertzis I, Papadopoulos S, Papapetrou O, Deligiannakis A and Garofalakis M Practical Private Range Search Revisited Proceedings of the 2016 International Conference on Management of Data, (185-198)
- Mao Y and Zhang Y Privacy Preserving Distributed Permutation Test Proceedings of the 4th ACM International Workshop on Security in Cloud Computing, (67-73)
- Wang L and Wyglinski A (2016). Detection of man-in-the-middle attacks using physical layer wireless security techniques, Wireless Communications & Mobile Computing, 16:4, (408-426), Online publication date: 1-Mar-2016.
- Goldwasser S and Tauman Kalai Y Cryptographic Assumptions Proceedings, Part I, of the 13th International Conference on Theory of Cryptography - Volume 9562, (505-522)
- Goldberg S, Xiao D, Tromer E, Barak B and Rexford J (2015). Path-quality monitoring in the presence of adversaries, IEEE/ACM Transactions on Networking, 23:6, (1729-1741), Online publication date: 1-Dec-2015.
- Chen F, Mohammed N, Wang S, He W, Cheng S and Jiang X Cloud-assisted distributed private data sharing Proceedings of the 6th ACM Conference on Bioinformatics, Computational Biology and Health Informatics, (202-211)
- Harn L, Lin C and Li Y (2015). Fair secret reconstruction in (t, n) secret sharing, Journal of Information Security and Applications, 23:C, (1-7), Online publication date: 1-Aug-2015.
- Miles E and Viola E (2015). On the Complexity of Constructing Pseudorandom Functions (Especially when They Don't Exist), Journal of Cryptology, 28:3, (509-532), Online publication date: 1-Jul-2015.
- Rupp A, Baldimtsi F, Hinterwälder G and Paar C (2015). Cryptographic Theory Meets Practice, ACM Transactions on Information and System Security, 17:3, (1-31), Online publication date: 27-Mar-2015.
- Papadopoulos S, Cormode G, Deligiannakis A and Garofalakis M (2014). Lightweight Query Authentication on Streams, ACM Transactions on Database Systems, 39:4, (1-45), Online publication date: 30-Dec-2015.
- Ramchen K and Waters B Fully Secure and Fast Signing from Obfuscation Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, (659-673)
- Baron J, Ishai Y and Ostrovsky R (2014). On linear-size pseudorandom generators and hardcore functions, Theoretical Computer Science, 554:C, (50-63), Online publication date: 16-Oct-2014.
- Gudymenko I A Privacy-Preserving E-Ticketing System for Public Transportation Supporting Fine-Granular Billing and Local Validation Proceedings of the 7th International Conference on Security of Information and Networks, (101-108)
- Sahai A and Waters B How to use indistinguishability obfuscation Proceedings of the forty-sixth annual ACM symposium on Theory of computing, (475-484)
- Guo S, Zhong S and Zhang A A Privacy Preserving Markov Model for Sequence Classification Proceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical Informatics, (561-568)
- Mu B and Bakiras S Private proximity detection for convex polygons Proceedings of the 12th International ACM Workshop on Data Engineering for Wireless and Mobile Acess, (36-43)
- Groat M, Edwards B, Horey J, He W and Forrest S (2013). Application and analysis of multidimensional negative surveys in participatory sensing applications, Pervasive and Mobile Computing, 9:3, (372-391), Online publication date: 1-Jun-2013.
- Hermans J, Peeters R and Onete C Efficient, secure, private distance bounding without key updates Proceedings of the sixth ACM conference on Security and privacy in wireless and mobile networks, (207-218)
- Kamara S, Mohassel P and Riva B Salus Proceedings of the 2012 ACM conference on Computer and communications security, (797-808)
- Popa R, Redfield C, Zeldovich N and Balakrishnan H (2012). CryptDB, Communications of the ACM, 55:9, (103-111), Online publication date: 1-Sep-2012.
- Dolev S and Kopeetsky M (2012). Anonymous transactions in computer networks, ACM Transactions on Autonomous and Adaptive Systems, 7:2, (1-14), Online publication date: 1-Jul-2012.
- Trevisan L (2012). Pseudorandomness and derandomization, XRDS: Crossroads, The ACM Magazine for Students, 18:3, (27-31), Online publication date: 1-Mar-2012.
- Fefferman B, Shaltiel R, Umans C and Viola E On beating the hybrid argument Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, (468-483)
- Popa R, Redfield C, Zeldovich N and Balakrishnan H CryptDB Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles, (85-100)
- Albergante L (2011). Automatic management of forums via artificial immune systems, International Journal of Autonomous and Adaptive Communications Systems, 4:2, (145-163), Online publication date: 1-Apr-2011.
- Bilogrevic I, Jadliwala M, Hubaux J, Aad I and Niemi V Privacy-preserving activity scheduling on mobile devices Proceedings of the first ACM conference on Data and application security and privacy, (261-272)
- Chang E, Fang C and Xu J A chameleon encryption scheme resistant to known-plaintext attack Proceedings of the tenth annual ACM workshop on Digital rights management, (25-34)
- Bernard S, Potop-Butucaru M and Tixeuil S A framework for secure and private P2P publish/subscribe Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems, (531-545)
- Atallah M and Frikken K Securely outsourcing linear algebra computations Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security, (48-59)
- Zhong S and Wu F (2010). A collusion-resistant routing scheme for noncooperative wireless ad hoc networks, IEEE/ACM Transactions on Networking, 18:2, (582-595), Online publication date: 1-Apr-2010.
- Boldyreva A, Cash D, Fischlin M and Warinschi B Foundations of Non-malleable Hash and One-Way Functions Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology, (524-541)
- Zhang Z, Cao Z, Ding N and Ma R Non-malleable Statistically Hiding Commitment from Any One-Way Function Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology, (303-318)
- Chen Y, Sion R and Carbunar B XPay Proceedings of the 8th ACM workshop on Privacy in the electronic society, (41-50)
- Dolev S and Kopeetsky M Anonymous Transactions in Computer Networks Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems, (297-310)
- Xu Y, Wang K, Yang G and Fu A Online anonymity for personalized web services Proceedings of the 18th ACM conference on Information and knowledge management, (1497-1500)
- Chen T and Zhong S (2009). Privacy-preserving backpropagation neural network learning, IEEE Transactions on Neural Networks, 20:10, (1554-1564), Online publication date: 1-Oct-2009.
- Zhong S, Yang Z and Chen T (2009). k-Anonymous data collection, Information Sciences: an International Journal, 179:17, (2948-2963), Online publication date: 1-Aug-2009.
- Halpern J, Pass R and Raman V An epistemic characterization of zero knowledge Proceedings of the 12th Conference on Theoretical Aspects of Rationality and Knowledge, (156-165)
- Ashrafi M and Ng S Collusion-resistant anonymous data collection method Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining, (69-78)
- Kozhevnikov A and Nikolenko S (2009). On complete one-way functions, Problems of Information Transmission, 45:2, (168-183), Online publication date: 1-Jun-2009.
- Castelluccia C, Chan A, Mykletun E and Tsudik G (2009). Efficient and provably secure aggregation of encrypted data in wireless sensor networks, ACM Transactions on Sensor Networks, 5:3, (1-36), Online publication date: 1-May-2009.
- Burmester M, Van Le T, De Medeiros B and Tsudik G (2009). Universally Composable RFID Identification and Authentication Protocols, ACM Transactions on Information and System Security, 12:4, (1-33), Online publication date: 1-Apr-2009.
- Hasan R, Sion R and Winslett M The case of the fake Picasso Proccedings of the 7th conference on File and storage technologies, (1-14)
- Kantarcioglu M and Kardes O (2008). Privacy-preserving data mining in the malicious model, International Journal of Information and Computer Security, 2:4, (353-375), Online publication date: 1-Jan-2009.
- Naor M and Rothblum G (2009). The complexity of online memory checking, Journal of the ACM, 56:1, (1-46), Online publication date: 1-Jan-2009.
- Williams P, Sion R and Carbunar B Building castles out of mud Proceedings of the 15th ACM conference on Computer and communications security, (139-148)
- Halpern J From qualitative to quantitative proofs of security properties using first-order conditional logic Proceedings of the 23rd national conference on Artificial intelligence - Volume 1, (454-459)
- Hallgren S, Kolla A, Sen P and Zhang S Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II, (592-603)
- Shaltiel R and Viola E Hardness amplification proofs require majority Proceedings of the fortieth annual ACM symposium on Theory of computing, (589-598)
- Jiang W, Clifton C and Kantarcıoğlu M (2008). Transforming semi-honest protocols to ensure accountability, Data & Knowledge Engineering, 65:1, (57-74), Online publication date: 1-Apr-2008.
- Jagannathan G and Wright R (2008). Privacy-preserving imputation of missing data, Data & Knowledge Engineering, 65:1, (40-56), Online publication date: 1-Apr-2008.
- Kobayashi H General properties of quantum zero-knowledge proofs Proceedings of the 5th conference on Theory of cryptography, (107-124)
- Malka L How to achieve perfect simulation and a complete problem for non-interactive perfect zero-knowledge Proceedings of the 5th conference on Theory of cryptography, (89-106)
- Brandt F and Sandholm T (2008). On the Existence of Unconditionally Privacy-Preserving Auction Protocols, ACM Transactions on Information and System Security, 11:2, (1-21), Online publication date: 1-Mar-2008.
- Canetti R, Cheung L, Kaynar D, Liskov M, Lynch N, Pereira O and Segala R (2008). Analyzing Security Protocols Using Time-Bounded Task-PIOAs, Discrete Event Dynamic Systems, 18:1, (111-159), Online publication date: 1-Mar-2008.
- Kiayias A, Tsiounis Y and Yung M Group encryption Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security, (181-199)
- Jakubowski M and Venkatesan R Randomized radon transforms for biometric authentication via fingerprint hashing Proceedings of the 2007 ACM workshop on Digital Rights Management, (90-94)
- Sion R, Bajaj S, Carbunar B and Katzenbeisser S NS2 Proceedings of the 33rd international conference on Very large data bases, (1342-1345)
- Zhong S and Wu F On designing collusion-resistant routing schemes for non-cooperative wireless ad hoc networks Proceedings of the 13th annual ACM international conference on Mobile computing and networking, (278-289)
- Wan L, Ng W, Han S and Lee V Privacy-preservation for gradient descent methods Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining, (775-783)
- Rothe J (2007). Review of "Complexity and Cryptography: An Introduction by John Talbot and Dominic Welsh", Cambridge University Press, 2006, 292 pages, ACM SIGACT News, 38:2, (16-20), Online publication date: 1-Jun-2007.
- McCarthy J, Krishnamurthi S, Guttman J and Ramsdell J Compiling cryptographic protocols for deployment on the web Proceedings of the 16th international conference on World Wide Web, (687-696)
- Elbaz A, Lee H, Servedio R and Wan A (2007). Separating Models of Learning from Correlated and Uncorrelated Data, The Journal of Machine Learning Research, 8, (277-290), Online publication date: 1-May-2007.
- Farashahi R, Schoenmakers B and Sidorenko A Efficient pseudorandom generators based on the DDH assumption Proceedings of the 10th international conference on Practice and theory in public-key cryptography, (426-441)
- Erkin Z, Piva A, Katzenbeisser S, Lagendijk R, Shokrollahi J, Neven G and Barni M (2007). Protection and retrieval of encrypted multimedia content, EURASIP Journal on Information Security, 2007, (1-20), Online publication date: 1-Jan-2007.
- Steinfeld R, Pieprzyk J and Wang H On the provable security of an efficient RSA-Based pseudorandom generator Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security, (194-209)
- Curtmola R, Garay J, Kamara S and Ostrovsky R Searchable symmetric encryption Proceedings of the 13th ACM conference on Computer and communications security, (79-88)
- Garcia F and van Rossum P Sound computational interpretation of symbolic hashes in the standard model Proceedings of the 1st international conference on Security, (33-47)
- Bogdanov A and Trevisan L (2006). Average-case complexity, Foundations and Trends® in Theoretical Computer Science, 2:1, (1-106), Online publication date: 1-Oct-2006.
- Naor M and Rothblum G Learning to impersonate Proceedings of the 23rd international conference on Machine learning, (649-656)
- Arvind V and Das B SZK proofs for black-box group problems Proceedings of the First international computer science conference on Theory and Applications, (6-17)
- Bender A (2006). Review of "Codes: The Guide to Secrecy from Ancient to Modern Times by Richard A. Mollin", Chapman & Hall/CRC, 2005, ACM SIGACT News, 37:1, (18-21), Online publication date: 1-Mar-2006.
- Jha S, Kruger L and McDaniel P Privacy preserving clustering Proceedings of the 10th European conference on Research in Computer Security, (397-417)
- Zhong S, Li L, Liu Y and Yang Y On designing incentive-compatible routing and forwarding protocols in wireless ad-hoc networks Proceedings of the 11th annual international conference on Mobile computing and networking, (117-131)
- Yang Z, Zhong S and Wright R Anonymity-preserving data collection Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining, (334-343)
- Pass R and shelat a Unconditional characterizations of non-interactive zero-knowledge Proceedings of the 25th annual international conference on Advances in Cryptology, (118-134)
- Barak B, Canetti R, Lindell Y, Pass R and Rabin T Secure computation without authentication Proceedings of the 25th annual international conference on Advances in Cryptology, (361-377)
- Brandt F and Sandholm T Decentralized voting with unconditional privacy Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems, (357-364)
- Brandt F and Sandholm T On correctness and privacy in distributed mechanisms Proceedings of the 2005 international conference on Agent-Mediated Electronic Commerce: designing Trading Agents and Mechanisms, (212-225)
- Hopper N On steganographic chosen covertext security Proceedings of the 32nd international conference on Automata, Languages and Programming, (311-323)
- Elbaz A, Lee H, Servedio R and Wan A Separating models of learning from correlated and uncorrelated data Proceedings of the 18th annual conference on Learning Theory, (637-651)
- Harnik D, Kilian J, Naor M, Reingold O and Rosen A On robust combiners for oblivious transfer and other primitives Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques, (96-113)
- Frikken K and Atallah M Achieving fairness in private contract negotiation Proceedings of the 9th international conference on Financial Cryptography and Data Security, (270-284)
- Katz J and Lindell Y Handling expected polynomial-time strategies in simulation-based security proofs Proceedings of the Second international conference on Theory of Cryptography, (128-149)
- Lin H, Trevisan L and Wee H On hardness amplification of one-way functions Proceedings of the Second international conference on Theory of Cryptography, (34-49)
- Ishai Y, Kushilevitz E and Ostrovsky R Sufficient conditions for collision-resistant hashing Proceedings of the Second international conference on Theory of Cryptography, (445-456)
- Brandt F and Sandholm T (Im)Possibility of Unconditionally Privacy-Preserving Auctions Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 2, (810-817)
- Canetti R, Dodis Y, Halevi S, Kushilevitz E and Sahai A Exposure-resilient functions and all-or-nothing transforms Proceedings of the 19th international conference on Theory and application of cryptographic techniques, (453-469)
Index Terms
- Foundations of Cryptography: Volume 1
Recommendations
Identity-Based signcryption from identity-based cryptography
WISA'11: Proceedings of the 12th international conference on Information Security ApplicationsA signcryption scheme encrypts and signs data in a single operation which is more efficient than using an encryption scheme combined with a signature scheme. Identity-based cryptography (IBC) does not require users to pre-compute key pairs and obtain ...
A Provably Secure Proxy Signature Scheme in Certificateless Cryptography
A proxy signature scheme enables an original signer to delegate its signing capability to a proxy signer and then the proxy signer can sign a message on behalf of the original signer. Recently, in order to eliminate the use of certificates in certified ...
Nonmalleable Cryptography
The notion of nonmalleable cryptography, an extension of semantically secure cryptography, is defined. Informally, in the context of encryption the additional requirement is that given the ciphertext it is impossible to generate a different ciphertext ...