The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for adversaries with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1984-1994 (16) 1995-1998 (17) 1999-2000 (32) 2001 (16) 2002 (28) 2003 (33) 2004 (54) 2005 (82) 2006 (69) 2007 (99) 2008 (119) 2009 (90) 2010 (46) 2011 (27) 2012 (33) 2013 (34) 2014 (26) 2015 (36) 2016 (36) 2017 (44) 2018 (58) 2019 (69) 2020 (62) 2021 (89) 2022 (74) 2023 (81) 2024 (21)
Publication types (Num. hits)
article(501) incollection(3) inproceedings(878) phdthesis(9)
Venues (Conferences, Journals, ...)
CoRR(187) IACR Cryptol. ePrint Arch.(68) EUROCRYPT(29) CCS(24) TCC(23) CRYPTO(22) PODC(19) ASIACRYPT(17) J. Cryptol.(17) ISIT(16) DISC(14) CT-RSA(13) IEEE Trans. Inf. Theory(12) AAMAS(11) Public Key Cryptography(11) CDC(10) More (+10 of total 503)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 687 occurrences of 415 keywords

Results
Found 1391 publication records. Showing 1391 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
84Yonatan Aumann, Yehuda Lindell Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries. Search on Bibsonomy TCC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
54Huafei Zhu Black-Box Constructions for Fully-Simulatable Oblivious Transfer Protocols. Search on Bibsonomy CANS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Black-box constructions, defensible adversary, malicious adversary, oblivious transfer protocols
53Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Andreas Tielmann The disagreement power of an adversary: extended abstract. Search on Bibsonomy PODC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF fault-tolerance, failure-detectors, adversaries
51Nan Zhang 0004, Wei Zhao 0001 Privacy Protection Against Malicious Adversaries in Distributed Information Sharing Systems. Search on Bibsonomy IEEE Trans. Knowl. Data Eng. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
45James Pita, Manish Jain, Fernando Ordóñez, Milind Tambe, Sarit Kraus, Reuma Magori-Cohen Effective solutions for real-world Stackelberg games: when agents must deal with human uncertainties. Search on Bibsonomy AAMAS (1) The full citation details ... 2009 DBLP  BibTeX  RDF Bayesian and Stackelberg games, security of agent systems, game theory
45Murat Kantarcioglu, Onur Kardes Privacy-Preserving Data Mining Applications in the Malicious Model. Search on Bibsonomy ICDM Workshops The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
45Ueli M. Maurer Information-Theoretically Secure Secret-Key Agreement by NOT Authenticated Public Discussion. Search on Bibsonomy EUROCRYPT The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
44Pierre-Alain Fouque, Antoine Joux, Gwenaëlle Martinet, Frédéric Valette Authenticated On-Line Encryption. Search on Bibsonomy Selected Areas in Cryptography The full citation details ... 2003 DBLP  DOI  BibTeX  RDF blockwise adversaries, provable security, authenticated encryption, Symmetric encryption, chosen ciphertext attacks
44B. Prabhu, K. Srinathan, C. Pandu Rangan Trading Players for Efficiency in Unconditional Multiparty Computation. Search on Bibsonomy SCN The full citation details ... 2002 DBLP  DOI  BibTeX  RDF generalized adversaries, secure multiparty computation
42Yehuda Lindell, Benny Pinkas An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries. Search on Bibsonomy EUROCRYPT The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
42Joseph Y. Halpern, Riccardo Pucella Modeling Adversaries in a Logic for Security Protocol Analysis. Search on Bibsonomy FASec The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
42Joseph Y. Halpern, Mark R. Tuttle Knowledge, Probability, and Adversaries. Search on Bibsonomy J. ACM The full citation details ... 1993 DBLP  DOI  BibTeX  RDF Byzantine generals problem, coordinated attack problem, probabilistic knowledge, game theory, probability, knowledge
41Yoav Freund, Michael J. Kearns, Yishay Mansour, Dana Ron, Ronitt Rubinfeld, Robert E. Schapire Efficient Algorithms for Learning to Play Repeated Games Against Computationally Bounded Adversaries. Search on Bibsonomy FOCS The full citation details ... 1995 DBLP  DOI  BibTeX  RDF repeated games playing, computationally bounded adversaries, penny-matching, classically studied finite automata, learning (artificial intelligence), game theory, finite automata, learning algorithm, computational efficiency
36Younho Lee, Yongsu Park Framework Design and Performance Analysis on Pairwise Key Establishment. Search on Bibsonomy APNOMS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Wireless sensor networks, network security, secure communications
36Abraham Bachrach, Alborz Geramifard, Daniel Gurdan, Ruijie He, Sam Prentice, Jan Stumpf, Nicholas Roy Co-ordinated Tracking and Planning Using Air and Ground Vehicles. Search on Bibsonomy ISER The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
36Virgil D. Gligor On the evolution of adversary models in security protocols: from the beginning to sensor networks. Search on Bibsonomy AsiaCCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
36Serge Vaudenay On Privacy Models for RFID. Search on Bibsonomy ASIACRYPT The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
36Ivan Damgård, Joe Kilian, Louis Salvail On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions. Search on Bibsonomy EUROCRYPT The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
35Yehuda Lindell, Benny Pinkas A Proof of Security of Yao's Protocol for Two-Party Computation. Search on Bibsonomy J. Cryptol. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Semi-honest adversaries, Yao’s two-party protocol, Secure two-party computation, Proofs of security
35Matthew K. Franklin, Mark A. Gondree, Payman Mohassel Improved Efficiency for Private Stable Matching. Search on Bibsonomy CT-RSA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Gale-Shapley, secure multiparty computation, stable matching, passive adversaries, stable marriage, privacy-preserving protocols
35Manuel Blum 0001, Shafi Goldwasser An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information. Search on Bibsonomy CRYPTO The full citation details ... 1984 DBLP  DOI  BibTeX  RDF chosen cyphertext attack, integer factorization, partial information, probabilistic encryption, passive adversaries
33Sidharth Jaggi, Michael Langberg, Sachin Katti, Tracey Ho, Dina Katabi, Muriel Médard, Michelle Effros Resilient Network Coding in the Presence of Byzantine Adversaries. Search on Bibsonomy IEEE Trans. Inf. Theory The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
33Carmit Hazay, Yehuda Lindell Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries. Search on Bibsonomy TCC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
33Vipul Goyal, Payman Mohassel, Adam D. Smith Efficient Two Party and Multi Party Computation Against Covert Adversaries. Search on Bibsonomy EUROCRYPT The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
33Yehuda Lindell, Benny Pinkas, Nigel P. Smart Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries. Search on Bibsonomy SCN The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
33Xiaole Bai, Wenjun Gu, Sriram Chellappan, Xun Wang, Dong Xuan, Bin Ma 0002 PAS: Predicate-Based Authentication Services Against Powerful Passive Adversaries. Search on Bibsonomy ACSAC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
33Oded Goldreich 0001 On Expected Probabilistic Polynomial-Time Adversaries: A Suggestion for Restricted Definitions and Their Benefits. Search on Bibsonomy TCC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
33Praveen Paruchuri, Jonathan P. Pearce, Milind Tambe, Fernando Ordóñez, Sarit Kraus An efficient heuristic approach for security against multiple adversaries. Search on Bibsonomy AAMAS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Bayesian and Stackelberg games, security of agent systems, game theory
33Giovanni Di Crescenzo Security of erasable memories against adaptive adversaries. Search on Bibsonomy StorageSS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF erasable memory, secure data deletion, storage security
33Daniele Micciancio, Bogdan Warinschi Soundness of Formal Encryption in the Presence of Active Adversaries. Search on Bibsonomy TCC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
33M. V. N. Ashwin Kumar, K. Srinathan, C. Pandu Rangan Asynchronous Perfectly Secure Computation Tolerating Generalized Adversaries. Search on Bibsonomy ACISP The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
33Donald Beaver, Stuart Haber Cryptographic Protocols Provably Secure Against Dynamic Adversaries. Search on Bibsonomy EUROCRYPT The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
30Xiaoling Zhou, Nan Yang, Ou Wu Combining Adversaries with Anti-adversaries in Training. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
30Xiaoling Zhou, Nan Yang, Ou Wu Combining Adversaries with Anti-adversaries in Training. Search on Bibsonomy AAAI The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
30Saadia Gabriel, Hamid Palangi, Yejin Choi 0001 NaturalAdversaries: Can Naturalistic Adversaries Be as Effective as Artificial Adversaries? Search on Bibsonomy CoRR The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
30Motasem Alfarra, Juan C. Pérez, Ali K. Thabet, Adel Bibi, Philip H. S. Torr, Bernard Ghanem Combating Adversaries with Anti-adversaries. Search on Bibsonomy AAAI The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
30Saadia Gabriel, Hamid Palangi, Yejin Choi 0001 NaturalAdversaries: Can Naturalistic Adversaries Be as Effective as Artificial Adversaries? Search on Bibsonomy EMNLP (Findings) The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
30Motasem Alfarra, Juan C. Pérez, Ali K. Thabet, Adel Bibi, Philip H. S. Torr, Bernard Ghanem Combating Adversaries with Anti-Adversaries. Search on Bibsonomy CoRR The full citation details ... 2021 DBLP  BibTeX  RDF
30Yonatan Aumann, Yehuda Lindell Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries. Search on Bibsonomy J. Cryptol. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
30Yonatan Aumann, Yehuda Lindell Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries. Search on Bibsonomy IACR Cryptol. ePrint Arch. The full citation details ... 2007 DBLP  BibTeX  RDF
27Zhenhua Liu 0005, Wenyuan Xu Zeroing-in on network metric minima for sink location determination. Search on Bibsonomy WISEC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF sink location privacy, sensor networks
27Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Andreas Tielmann The Disagreement Power of an Adversary. Search on Bibsonomy DISC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
27John L. Miller 0001, Jon Crowcroft Probabilistic event resolution with the pairwise random protocol. Search on Bibsonomy NOSSDAV The full citation details ... 2009 DBLP  DOI  BibTeX  RDF pairwise random protocol, secure coin flipping, security, fairness, distributed virtual environment, network games, cheating, bit commitment
27Junji Shikata, Tsutomu Matsumoto Unconditionally Secure Steganography Against Active Attacks. Search on Bibsonomy IEEE Trans. Inf. Theory The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
27Aggelos Kiayias, Hong-Sheng Zhou Equivocal Blind Signatures and Adaptive UC-Security. Search on Bibsonomy TCC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
27Jang-Ping Sheu, Jehn-Ruey Jiang, Ching Tu Anonymous Path Routing in Wireless Sensor Networks. Search on Bibsonomy ICC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
27Bogdan S. Chlebus, Dariusz R. Kowalski, Mariusz A. Rokicki Stability of the Multiple-Access Channel Under Maximum Broadcast Loads. Search on Bibsonomy SSS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF deterministic broadcast, adversarial queuing, stability, fairness, latency, multiple-access channel
27Aggelos Kiayias, Hong-Sheng Zhou Trading Static for Adaptive Security in Universally Composable Zero-Knowledge. Search on Bibsonomy ICALP The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
27Guomin Yang, Jing Chen 0001, Duncan S. Wong, Xiaotie Deng, Dongsheng Wang 0002 A More Natural Way to Construct Identity-Based Identification Schemes. Search on Bibsonomy ACNS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Concurrent attacks, Identity-based cryptography, Identification schemes
27Souvik Ray, Zhao Zhang SCUBE: A DoS-Resistant Distributed Search Protocol. Search on Bibsonomy ICCCN The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
27Nan Zhang 0004 On the Communication Complexity of Privacy-Preserving Information Sharing Protocols. Search on Bibsonomy ISI The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
27Men Long, Chwan-Hwa John Wu Energy-efficient and intrusion-resilient authentication for ubiquitous access to factory floor information. Search on Bibsonomy IEEE Trans. Ind. Informatics The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
27Gene Itkis, Robert McNerney, Scott Russell Intrusion-Resilient Secure Channels. Search on Bibsonomy ACNS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
27Lakshminarayanan Subramanian, Randy H. Katz, Volker Roth 0002, Scott Shenker, Ion Stoica Reliable broadcast in unknown fixed-identity networks. Search on Bibsonomy PODC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF unknown network, byzantine agreement, reliable broadcast
27Bogdan S. Chlebus, Mariusz A. Rokicki Asynchronous Broadcast in Radio Networks. Search on Bibsonomy SIROCCO The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
27Jiejun Kong, Xiaoyan Hong ANODR: anonymous on demand routing with untraceable routes for mobile ad-hoc networks. Search on Bibsonomy MobiHoc The full citation details ... 2003 DBLP  DOI  BibTeX  RDF trapdoor, mobile ad-hoc network, broadcast, anonymity, pseudonymity, on-demand routing, untraceability
27Ran Canetti, Ivan Damgård, Stefan Dziembowski, Yuval Ishai, Tal Malkin On Adaptive vs. Non-adaptive Security of Multiparty Protocols. Search on Bibsonomy EUROCRYPT The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
26Salil P. Vadhan Constructing Locally Computable Extractors and Cryptosystems in the Bounded-Storage Model. Search on Bibsonomy J. Cryptol. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Everlasting security, Space-bounded adversaries, Averaging samplers, Expander graphs, Extractors, Unconditional security, Bounded-storage model
26Ran Canetti, Rosario Gennaro Incoercible Multiparty Computation (extended abstract). Search on Bibsonomy FOCS The full citation details ... 1996 DBLP  DOI  BibTeX  RDF incoercible multiparty computation, secure multiparty protocols, coercion resilience, computationally bounded adversaries, public communication channels, adaptive security problem, deniable encryptions, protocols, trapdoor permutations
24Doran Chakraborty, Peter Stone Online Multiagent Learning against Memory Bounded Adversaries. Search on Bibsonomy ECML/PKDD (1) The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
24Marc Mouffron, Frederic Rousseau 0002, Huafei Zhu Secure Two-Party Computation of Squared Euclidean Distances in the Presence of Malicious Adversaries. Search on Bibsonomy Inscrypt The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Squared Euclidean Distance, Stand-alone and simulation-based model, Secure two-party computation
24Angelo Troina, Alessandro Aldini, Roberto Gorrieri Towards a Formal Treatment of Secrecy Against Computational Adversaries. Search on Bibsonomy Global Computing The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
24K. Srinathan, M. V. N. Ashwin Kumar, C. Pandu Rangan Asynchronous Secure Communication Tolerating Mixed Adversaries. Search on Bibsonomy ASIACRYPT The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
24K. Srinathan, C. Pandu Rangan Tolerating Generalized Mobile Adversaries in Secure Multiparty Computation. Search on Bibsonomy INDOCRYPT The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
18Michal Sramka, Reihaneh Safavi-Naini, Jörg Denzinger, Mina Askari A practice-oriented framework for measuring privacy and utility in data sanitization systems. Search on Bibsonomy EDBT/ICDT Workshops The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
18Dmitry G. Korzun, Andrei V. Gurtov A local equilibrium model for P2P resource ranking. Search on Bibsonomy SIGMETRICS Perform. Evaluation Rev. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
18Bill Lin 0001, Jun (Jim) Xu, Nan Hua, Hao Wang 0006, Haiquan (Chuck) Zhao A randomized interleaved DRAM architecture for the maintenance of exact statistics counters. Search on Bibsonomy SIGMETRICS Perform. Evaluation Rev. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
18Sipat Triukose, Zhihua Wen, Michael Rabinovich Content delivery networks: how big is big enough? Search on Bibsonomy SIGMETRICS Perform. Evaluation Rev. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
18Alma Riska, Erik Riedel Evaluation of disk-level workloads at different time scales. Search on Bibsonomy SIGMETRICS Perform. Evaluation Rev. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
18Patrick Traynor, William Enck, Patrick D. McDaniel, Thomas La Porta Mitigating attacks on open functionality in SMS-capable cellular networks. Search on Bibsonomy IEEE/ACM Trans. Netw. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF open-functionality, denial-of-service, telecommunications, SMS
18Iuon-Chang Lin, Shu-Yan Huang A Polynomial Based Key Establishment Scheme for Heterogeneous Sensor Networks. Search on Bibsonomy IAS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
18Hemanta K. Maji, Manoj Prabhakaran 0001, Mike Rosulek Complexity of Multi-party Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation. Search on Bibsonomy TCC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
18Vibhor Rastogi, Michael Hay, Gerome Miklau, Dan Suciu Relationship privacy: output perturbation for queries with joins. Search on Bibsonomy PODS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF output perturbation, social networks, sensitivity, privacy preserving data mining, join queries, private data analysis
18Arnold L. Rosenberg Path-robust multi-channel wireless networks. Search on Bibsonomy IPDPS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
18Yejun Zhou, Hui Li 0006, Jianfeng Ma 0001 Secure Error-Correction Network Coding in a Randomized Setting. Search on Bibsonomy ISA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
18Chi-Jen Lu On the Security Loss in Cryptographic Reductions. Search on Bibsonomy EUROCRYPT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
18Cristian Ene, Yassine Lakhnech, Van Chan Ngo Formal Indistinguishability Extended to the Random Oracle Model. Search on Bibsonomy ESORICS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
18Timo Brecher, Emmanuel Bresson, Mark Manulis Fully Robust Tree-Diffie-Hellman Group Key Exchange. Search on Bibsonomy CANS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
18Huafei Zhu, Feng Bao 0001 Constructing Universally Composable Oblivious Transfers from Double Trap-Door Encryptions. Search on Bibsonomy AFRICACRYPT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF simulator, Oblivious transfer, universally composable
18Bogdan S. Chlebus, Dariusz R. Kowalski Locally scalable randomized consensus for synchronous crash failures. Search on Bibsonomy SPAA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF bit communication complexity, graph expansion, fault tolerance, scalability, lower bound, message passing, randomization, consensus, synchrony
18Alessandro Aldini, Alessandra Di Pierro Estimating the maximum information leakage. Search on Bibsonomy Int. J. Inf. Sec. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Approximate noninterference, Bisimulation semantics, Process algebra, Probabilistic models, Covert channels
18Jonathan Katz, Yehuda Lindell Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs. Search on Bibsonomy J. Cryptol. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Expected polynomial-time, Black-box simulation, Zero-knowledge, Secure multiparty computation
18Michael Backes 0001, Dominique Unruh Computational Soundness of Symbolic Zero-Knowledge Proofs Against Active Attackers. Search on Bibsonomy CSF The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Formal methods, zero-knowledge proofs, computational soundness
18Ghaith Hammouri, Berk Sunar PUF-HB: A Tamper-Resilient HB Based Authentication Protocol. Search on Bibsonomy ACNS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF HB+, tamper resilience, provable security, PUF
18Wenliang Du, Zhouxuan Teng, Zutao Zhu Privacy-MaxEnt: integrating background knowledge in privacy quantification. Search on Bibsonomy SIGMOD Conference The full citation details ... 2008 DBLP  DOI  BibTeX  RDF privacy quantification, data publishing
18Carmine Ventre, Ivan Visconti Completely Non-malleable Encryption Revisited. Search on Bibsonomy Public Key Cryptography The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
18Liran Ma, Amin Y. Teymorian, Xiuzhen Cheng 0001 A Hybrid Rogue Access Point Protection Framework for Commodity Wi-Fi Networks. Search on Bibsonomy INFOCOM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
18Wei-Chuen Yau, Swee-Huay Heng, Bok-Min Goi Off-Line Keyword Guessing Attacks on Recent Public Key Encryption with Keyword Search Schemes. Search on Bibsonomy ATC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF off-line keyword guessing attack, privacy, public key encryption, database security, Searching on encrypted data
18Marcin Bienkowski, Marek Chrobak, Lukasz Jez Randomized Algorithms for Buffer Management with 2-Bounded Delay. Search on Bibsonomy WAOA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
18Mehmet S. Kiraz, Berry Schoenmakers An Efficient Protocol for Fair Secure Two-Party Computation. Search on Bibsonomy CT-RSA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
18Saurabh Panjwani Tackling Adaptive Corruptions in Multicast Encryption Protocols. Search on Bibsonomy TCC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Adaptive Corruptions, Selective Decryption, Multicast, Encryption
18Stefan Dziembowski, Krzysztof Pietrzak Intrusion-Resilient Secret Sharing. Search on Bibsonomy FOCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
18Mehmet S. Kiraz, Berry Schoenmakers, José Villegas Efficient Committed Oblivious Transfer of Bit Strings. Search on Bibsonomy ISC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Committed oblivious transfer, Commitments, Homomorphic encryption
18Xinyi Huang 0001, Yi Mu 0001, Willy Susilo, Duncan S. Wong, Wei Wu 0001 Certificateless Signature Revisited. Search on Bibsonomy ACISP The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Certificateless cryptology, Signature, Security model, Random oracle
18Bogdan Groza An Extension of the RSA Trapdoor in a KEM/DEM Framework. Search on Bibsonomy SYNASC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
18Hassan Jameel, Riaz Ahmed Shaikh 0001, Heejo Lee, Sungyoung Lee Human Identification Through Image Evaluation Using Secret Predicates. Search on Bibsonomy CT-RSA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
18Dmitry Gavinsky, Julia Kempe, Iordanis Kerenidis, Ran Raz, Ronald de Wolf Exponential separations for one-way quantum communication complexity, with applications to cryptography. Search on Bibsonomy STOC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF cryptography, communication complexity, quantum
18Ueli M. Maurer, Stefano Tessaro Domain Extension of Public Random Functions: Beyond the Birthday Barrier. Search on Bibsonomy CRYPTO The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
18François Macé, François-Xavier Standaert, Jean-Jacques Quisquater Information Theoretic Evaluation of Side-Channel Resistant Logic Styles. Search on Bibsonomy CHES The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
18Adi Rosén, Michael S. Tsirkin On Delivery Times in Packet Networks under Adversarial Traffic. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 1391 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][10][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license