Financial Cryptography and Data Security
暂无分享,去创建一个
[1] J. Nash,et al. NON-COOPERATIVE GAMES , 1951, Classics in Game Theory.
[2] Di Ma,et al. Secure Proximity Detection for NFC Devices Based on Ambient Sensor Data , 2012, ESORICS.
[3] Carmit Hazay,et al. Efficient Set Operations in the Presence of Malicious Adversaries , 2010, Journal of Cryptology.
[4] Richard Cole,et al. Fast-converging tatonnement algorithms for one-time and ongoing market problems , 2008, STOC.
[5] Rafail Ostrovsky,et al. Round Efficiency of Multi-party Computation with a Dishonest Majority , 2003, EUROCRYPT.
[6] Georg Fuchsbauer,et al. Anonymous attestation with user-controlled linkability , 2013, International Journal of Information Security.
[7] Sam Ransbotham,et al. An Empirical Analysis of Exploitation Attempts Based on Vulnerabilities in Open Source Software , 2010, WEIS.
[8] David Pointcheval,et al. Dynamic Fully Anonymous Short Group Signatures , 2006, VIETCRYPT.
[9] Marina Blanton,et al. Private and oblivious set and multiset operations , 2012, AsiaCCS.
[10] C. P. Schnorr,et al. Efficient Identification and Signatures for Smart Cards (Abstract) , 1989, EUROCRYPT.
[11] Benny Pinkas,et al. Fairplay - Secure Two-Party Computation System (Awarded Best Student Paper!) , 2004 .
[12] Yehuda Lindell,et al. Constructions of truly practical secure protocols using standardsmartcards , 2008, CCS.
[13] James Patterson,et al. You've been warned... , 2006, BMJ : British Medical Journal.
[14] Eric Wustrow,et al. ZMap: Fast Internet-wide Scanning and Its Security Applications , 2013, USENIX Security Symposium.
[15] Benny Pinkas,et al. Secure Set Intersection with Untrusted Hardware Tokens , 2011, CT-RSA.
[16] Nick Mathewson,et al. Tor: The Second-Generation Onion Router , 2004, USENIX Security Symposium.
[17] Craig Gentry,et al. Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers , 2010, CRYPTO.
[18] Malte Möser. Anonymity of Bitcoin Transactions An Analysis of Mixing Services , 2013 .
[19] Florian Kerschbaum,et al. Outsourced private set intersection using homomorphic encryption , 2012, ASIACCS '12.
[20] Jens Groth,et al. Short Pairing-Based Non-interactive Zero-Knowledge Arguments , 2010, ASIACRYPT.
[21] Andrew Chi-Chih Yao,et al. How to generate and exchange secrets , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[22] Bingsheng Zhang,et al. Efficient Modular NIZK Arguments from Shift and Product , 2013, CANS.
[23] Víctor M Eguíluz,et al. Epidemic threshold in structured scale-free networks. , 2002, Physical review letters.
[24] David Chaum,et al. Untraceable electronic mail, return addresses, and digital pseudonyms , 1981, CACM.
[25] John C. Mitchell,et al. Text-based CAPTCHA strengths and weaknesses , 2011, CCS '11.
[26] Xiang Gao,et al. Comparing and fusing different sensor modalities for relay attack resistance in Zero-Interaction Authentication , 2014, 2014 IEEE International Conference on Pervasive Computing and Communications (PerCom).
[27] Pascal Paillier,et al. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes , 1999, EUROCRYPT.
[28] Bart Preneel,et al. Universally Composable Adaptive Priced Oblivious Transfer , 2009, Pairing.
[29] Ivan Damgård,et al. Secure Multiparty Computation Goes Live , 2009, Financial Cryptography.
[30] Hal R. Varian,et al. System Reliability and Free Riding , 2004, Economics of Information Security.
[31] Yuval Ishai,et al. Bounded Key-Dependent Message Security , 2010, IACR Cryptol. ePrint Arch..
[32] Prateek Mittal,et al. BotGrep: Finding P2P Bots with Structured Graph Analysis , 2010, USENIX Security Symposium.
[33] Nicolas Christin,et al. Traveling the silk road: a measurement analysis of a large anonymous online marketplace , 2012, WWW.
[34] Jean-François Raymond,et al. Traffic Analysis: Protocols, Attacks, Design Issues, and Open Problems , 2000, Workshop on Design Issues in Anonymity and Unobservability.
[35] Trent Jaeger,et al. Implicit Flows: Can't Live with 'Em, Can't Live without 'Em , 2008, ICISS.
[36] M. Chuah,et al. Spam Detection on Twitter Using Traditional Classifiers , 2011, ATC.
[37] Martin Mauve,et al. CLL: A Cryptographic Link Layer for Local Area Networks , 2008, SCN.
[38] Jörg Widmer,et al. Survey on Energy Consumption Entities on the Smartphone Platform , 2011, 2011 IEEE 73rd Vehicular Technology Conference (VTC Spring).
[39] Lucas Ballard,et al. Achieving Efficient Conjunctive Keyword Searches over Encrypted Data , 2005, ICICS.
[40] Amit Sahai,et al. Pseudonym Systems (Extended Abstract) , 2000 .
[41] Vinod Vaikuntanathan,et al. Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE , 2012, EUROCRYPT.
[42] Yehuda Lindell,et al. A Proof of Security of Yao’s Protocol for Two-Party Computation , 2009, Journal of Cryptology.
[43] Christopher Krügel,et al. Enemy of the State: A State-Aware Black-Box Web Vulnerability Scanner , 2012, USENIX Security Symposium.
[44] Alessandro Vespignani,et al. Epidemic dynamics in finite size scale-free networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.
[45] Ghassan O. Karame,et al. Evaluating User Privacy in Bitcoin , 2013, Financial Cryptography.
[46] Emiliano De Cristofaro,et al. Practical Private Set Intersection Protocols with Linear Complexity , 2010, Financial Cryptography.
[47] Yuval Ishai,et al. Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator , 2005, CRYPTO.
[48] Dawn Xiaodong Song,et al. Privacy-Preserving Set Operations , 2005, CRYPTO.
[49] Nicolas Christin,et al. When Information Improves Information Security , 2010, Financial Cryptography.
[50] Jonathan Katz,et al. Partial Fairness in Secure Two-Party Computation , 2010, Journal of Cryptology.
[51] Tomas Toft,et al. On Secure Two-Party Integer Division , 2012, Financial Cryptography.
[52] Lior Malka,et al. VMCrypt: modular software architecture for scalable secure computation , 2011, CCS '11.
[53] Yuval Ishai,et al. Priced Oblivious Transfer: How to Sell Digital Goods , 2001, EUROCRYPT.
[54] Emiliano De Cristofaro,et al. Countering GATTACA: efficient and secure testing of fully-sequenced human genomes , 2011, CCS '11.
[55] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.
[56] Claudio Soriente,et al. Size-Hiding in Private Set Intersection: Existential Results and Constructions , 2012, AFRICACRYPT.
[57] Yehuda Lindell. Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation , 2001, CRYPTO.
[58] Moti Yung,et al. Efficient robust private set intersection , 2012, Int. J. Appl. Cryptogr..
[59] Emiliano De Cristofaro,et al. Linear-Complexity Private Set Intersection Protocols Secure in Malicious Model , 2010, ASIACRYPT.
[60] Jeffrey O. Kephart,et al. Directed-graph epidemiological models of computer viruses , 1991, Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy.
[61] Meni Rosenfeld,et al. Analysis of Bitcoin Pooled Mining Reward Systems , 2011, ArXiv.
[62] Yehuda Lindell,et al. Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries , 2008, Journal of Cryptology.
[63] Gerhard P. Hancke. Practical attacks on proximity identification systems , 2006, 2006 IEEE Symposium on Security and Privacy (S&P'06).
[64] Jonathan Katz,et al. Private Set Intersection: Are Garbled Circuits Better than Custom Protocols? , 2012, NDSS.
[65] Ernest F. Brickell,et al. Direct anonymous attestation , 2004, CCS '04.
[66] Moni Naor,et al. Games for exchanging information , 2008, STOC.
[67] Joseph Y. Halpern,et al. Game Theory with Costly Computation , 2008, ArXiv.
[68] Silvio Micali,et al. Probabilistic Encryption , 1984, J. Comput. Syst. Sci..
[69] Levente Buttyán,et al. A Survey of Interdependent Information Security Games , 2014, ACM Comput. Surv..
[70] S A R A H M E I K L E J O H N,et al. A Fistful of Bitcoins Characterizing Payments Among Men with No Names , 2013 .
[71] Changyu Dong,et al. When private set intersection meets big data: an efficient and scalable protocol , 2013, CCS.
[72] Qi He,et al. TwitterRank: finding topic-sensitive influential twitterers , 2010, WSDM '10.
[73] Gerhard P. Hancke,et al. Practical NFC Peer-to-Peer Relay Attack Using Mobile Phones , 2010, RFIDSec.
[74] Ivan Damgård,et al. Asynchronous Multiparty Computation: Theory and Implementation , 2008, IACR Cryptol. ePrint Arch..
[75] Moni Naor,et al. A minimal model for secure computation (extended abstract) , 1994, STOC '94.
[76] Andrew Chi-Chih Yao,et al. Protocols for secure computations , 1982, FOCS 1982.
[77] Craig Gentry,et al. A Simple BGN-Type Cryptosystem from LWE , 2010, EUROCRYPT.
[78] A. Yao,et al. Fair exchange with a semi-trusted third party (extended abstract) , 1997, CCS '97.
[79] Yusheng Ji,et al. Pattern-Based Alignment of Audio Data for Ad Hoc Secure Device Pairing , 2012, 2012 16th International Symposium on Wearable Computers.
[80] Bart Jacobs,et al. Increased security through open source , 2007, Commun. ACM.
[81] Amos Fiat,et al. How to Prove Yourself: Practical Solutions to Identification and Signature Problems , 1986, CRYPTO.
[82] Alessandro Vespignani,et al. Epidemic spreading in scale-free networks. , 2000, Physical review letters.
[83] Ran Canetti,et al. The random oracle methodology, revisited , 2000, JACM.
[84] Eric Wustrow,et al. CAge: Taming Certificate Authorities by Inferring Restricted Scopes , 2013, Financial Cryptography.
[85] Craig Gentry,et al. Quadratic Span Programs and Succinct NIZKs without PCPs , 2013, IACR Cryptol. ePrint Arch..
[86] Avishai Wool,et al. Picking Virtual Pockets using Relay Attacks on Contactless Smartcard , 2005, First International Conference on Security and Privacy for Emerging Areas in Communications Networks (SECURECOMM'05).
[87] Yusheng Ji,et al. Using ambient audio in secure mobile phone communication , 2012, 2012 IEEE International Conference on Pervasive Computing and Communications Workshops.
[88] G. Jolly. EXPLICIT ESTIMATES FROM CAPTURE-RECAPTURE DATA WITH BOTH DEATH AND IMMIGRATION-STOCHASTIC MODEL. , 1965, Biometrika.
[89] Jacques Stern,et al. Security Arguments for Digital Signatures and Blind Signatures , 2015, Journal of Cryptology.
[90] Manoj Prabhakaran,et al. Resource Fairness and Composability of Cryptographic Protocols , 2006, Journal of Cryptology.
[91] Alice Kao. RIAA v. Verizon: Applying the Subpoena Provision of the DMCA , 2004 .
[92] Dan Bogdanov,et al. Sharemind: A Framework for Fast Privacy-Preserving Computations , 2008, ESORICS.
[93] Jan Camenisch,et al. Fair Private Set Intersection with a Semi-trusted Arbiter , 2013, IACR Cryptol. ePrint Arch..
[94] Moni Naor,et al. Privacy preserving auctions and mechanism design , 1999, EC '99.
[95] Eli Ben-Sasson,et al. Zerocash: Decentralized Anonymous Payments from Bitcoin , 2014, 2014 IEEE Symposium on Security and Privacy.
[96] George Danezis,et al. Pinocchio coin: building zerocoin from a succinct pairing-based proof system , 2013, PETShop '13.
[97] Jan Camenisch,et al. Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials , 2002, CRYPTO.
[98] Stefan Katzenbeisser,et al. Structure and Anonymity of the Bitcoin Transaction Graph , 2013, Future Internet.
[99] Paul C. van Oorschot,et al. Using a Personal Device to Strengthen Password Authentication from an Untrusted Computer , 2007, Financial Cryptography.
[100] Yuguang Fang,et al. MASK: anonymous on-demand routing in mobile ad hoc networks , 2006, IEEE Transactions on Wireless Communications.
[101] Helger Lipmaa,et al. Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments , 2012, TCC.
[102] Ran Canetti,et al. Toward a Game Theoretic View of Secure Computation , 2011, Journal of Cryptology.
[103] Rafail Ostrovsky,et al. Searchable symmetric encryption: improved definitions and efficient constructions , 2006, CCS '06.
[104] Abhi Shelat,et al. Additive Combinatorics and Discrete Logarithm Based Range Protocols , 2010, ACISP.
[105] Nicholas Hopper,et al. Shadow: Running Tor in a Box for Accurate and Efficient Experimentation , 2011, NDSS.
[106] Luca Faust,et al. Modern Operating Systems , 2016 .
[107] Emin Gün Sirer,et al. Majority Is Not Enough: Bitcoin Mining Is Vulnerable , 2013, Financial Cryptography.
[108] Jens Grossklags,et al. Blue versus Red: Towards a Model of Distributed Security Attacks , 2009, Financial Cryptography.
[109] Chris Kanich,et al. Taster's choice: a comparative analysis of spam feeds , 2012, Internet Measurement Conference.
[110] Ran Canetti,et al. Universally Composable Security with Local Adversaries , 2012, SCN.
[111] Rainer Böhme,et al. Security Games with Market Insurance , 2011, GameSec.
[112] Hector Garcia-Molina,et al. PPay: micropayments for peer-to-peer systems , 2003, CCS '03.
[113] Ivan Damgård,et al. Towards Practical Public Key Systems Secure Against Chosen Ciphertext Attacks , 1991, CRYPTO.
[114] Collin Jackson,et al. Accountable key infrastructure (AKI): a proposal for a public-key validation infrastructure , 2013, WWW.
[115] Elaine Shi,et al. Bitter to Better - How to Make Bitcoin a Better Currency , 2012, Financial Cryptography.
[116] Adam Back,et al. Hashcash - A Denial of Service Counter-Measure , 2002 .
[117] Benny Pinkas,et al. FairplayMP: a system for secure multi-party computation , 2008, CCS.
[118] Peishun Wang,et al. Keyword Field-Free Conjunctive Keyword Searches on Encrypted Data and Extension for Dynamic Groups , 2008, CANS.
[119] Emin Gün Sirer,et al. KARMA : A Secure Economic Framework for Peer-to-Peer Resource Sharing , 2003 .
[120] Ian Goldberg,et al. Anonymity and one-way authentication in key exchange protocols , 2012, Designs, Codes and Cryptography.
[121] Charalampos Papamanthou,et al. Parallel and Dynamic Searchable Symmetric Encryption , 2013, Financial Cryptography.
[122] Rafail Ostrovsky,et al. Multiparty Proximity Testing with Dishonest Majority from Equality Testing , 2012, ICALP.
[123] Marc Fischlin,et al. Domain-Specific Pseudonymous Signatures for the German Identity Card , 2012, ISC.
[124] Dan Boneh,et al. Location Privacy via Private Proximity Testing , 2011, NDSS.
[125] Jean-Pierre Seifert,et al. SMS-Based One-Time Passwords: Attacks and Defense - (Short Paper) , 2013, DIMVA.
[126] Kaoru Kurosawa,et al. UC-Secure Searchable Symmetric Encryption , 2012, Financial Cryptography.
[127] Yael Tauman Kalai,et al. Reusable garbled circuits and succinct functional encryption , 2013, STOC '13.
[128] Eric R. Verheul,et al. Self-Blindable Credential Certificates from the Weil Pairing , 2001, ASIACRYPT.
[129] Martin Lee,et al. WHO'S NEXT? IDENTIFYING RISK FACTORS FOR SUBJECTS OF TARGETED ATTACKS , 2012 .
[130] Hovav Shacham,et al. Measuring the Practical Impact of DNSSEC Deployment , 2013, USENIX Security Symposium.
[131] Stefan Schmid,et al. When selfish meets evil: byzantine players in a virus inoculation game , 2006, PODC '06.
[132] Roger Dingledine,et al. From a Trickle to a Flood: Active Attacks on Several Mix Types , 2002, Information Hiding.
[133] Kazue Sako,et al. Receipt-Free Mix-Type Voting Scheme - A Practical Solution to the Implementation of a Voting Booth , 1995, EUROCRYPT.
[134] Aron Laszka,et al. The Complexity of Estimating Systematic Risk in Networks , 2014, 2014 IEEE 27th Computer Security Foundations Symposium.
[135] Chris Clifton,et al. Privacy-Preserving Decision Trees over Vertically Partitioned Data , 2005, DBSec.
[136] Hugo Krawczyk,et al. Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries , 2013, IACR Cryptol. ePrint Arch..
[137] Adrian Perrig,et al. Phoolproof Phishing Prevention , 2006, Financial Cryptography.
[138] Fabrice Boudot,et al. Efficient Proofs that a Committed Number Lies in an Interval , 2000, EUROCRYPT.
[139] Pascal Urien,et al. Elliptic curve-based RFID/NFC authentication with temperature sensor input for relay attacks , 2014, Decis. Support Syst..
[140] Melissa Chase,et al. Structured Encryption and Controlled Disclosure , 2010, IACR Cryptol. ePrint Arch..
[141] Ivan Damgård,et al. A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System , 2001, Public Key Cryptography.
[142] Rainer Böhme,et al. Modeling Cyber-Insurance: Towards a Unifying Framework , 2010, WEIS.
[143] Alex Biryukov,et al. Trawling for Tor Hidden Services: Detection, Measurement, Deanonymization , 2013, 2013 IEEE Symposium on Security and Privacy.
[144] Robin Sommer,et al. Here's my cert, so trust me, maybe?: understanding TLS errors on the web , 2013, WWW.
[145] Minas Gjoka,et al. Practical Recommendations on Crawling Online Social Networks , 2011, IEEE Journal on Selected Areas in Communications.
[146] Nick Mathewson,et al. Anonymity Loves Company: Usability and the Network Effect , 2006, WEIS.
[147] Torben P. Pedersen. Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing , 1991, CRYPTO.
[148] Sergei Izmalkov,et al. Rational secure computation and ideal mechanism design , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[149] Stanislaw Jarecki,et al. Cryptographic Primitives Enforcing Communication and Storage Complexity , 2002, Financial Cryptography.
[150] Anna Lysyanskaya,et al. Rationality and Adversarial Behavior in Multi-party Computation , 2006, CRYPTO.
[151] Chris Clifton,et al. AC-Framework for Privacy-Preserving Collaboration , 2007, SDM.
[152] Moni Naor,et al. Zaps and Their Applications , 2007, SIAM J. Comput..
[153] David Thomas,et al. The Art in Computer Programming , 2001 .
[154] Helger Lipmaa,et al. Verifiable Homomorphic Oblivious Transfer and Private Equality Test , 2003, ASIACRYPT.
[155] Ronald L. Rivest,et al. Electronic Lottery Tickets as Micropayments , 1997, Financial Cryptography.
[156] Xiaomin Liu,et al. Fast Secure Computation of Set Intersection , 2010, SCN.
[157] Ulrich Greveler. VTANs - Eine Anwendung visueller Kryptographie in der Online-Sicherheit , 2007, GI Jahrestagung.
[158] Michael Rogers,et al. Secure communication over diverse transports: [short paper] , 2012, WPES '12.
[159] Tyler Moore,et al. The Economics of Information Security , 2006, Science.
[160] Benny Pinkas,et al. Efficient Private Matching and Set Intersection , 2004, EUROCRYPT.
[161] Herbert Bos,et al. Memory Errors: The Past, the Present, and the Future , 2012, RAID.
[162] James E. Eaves,et al. Walrasian Tâtonnement Auctions on the Tokyo Grain Exchange , 2007 .
[163] Nicolas Christin,et al. Secure or insure?: a game-theoretic analysis of information security games , 2008, WWW.
[164] Helger Lipmaa,et al. Succinct Non-Interactive Zero Knowledge Arguments from Span Programs and Linear Error-Correcting Codes , 2013, IACR Cryptol. ePrint Arch..
[165] Keith B. Frikken,et al. PBS: Private Bartering Systems , 2008, Financial Cryptography.
[166] Ronald Cramer,et al. A secure and optimally efficient multi-authority election scheme , 1997, Eur. Trans. Telecommun..
[167] Valtteri Niemi,et al. Secure Vickrey Auctions without Threshold Trust , 2002, Financial Cryptography.
[168] Sunny King,et al. PPCoin: Peer-to-Peer Crypto-Currency with Proof-of-Stake , 2012 .
[169] Eyal de Lara,et al. User mobility for opportunistic ad-hoc networking , 2004, Sixth IEEE Workshop on Mobile Computing Systems and Applications.
[170] Dogan Kesdogan,et al. Stop-and-Go-MIXes Providing Probabilistic Anonymity in an Open System , 1998, Information Hiding.
[171] John Krumm,et al. The NearMe Wireless Proximity Server , 2004, UbiComp.
[172] Tatsuaki Okamoto,et al. Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes , 1992, CRYPTO.
[173] Angelos D. Keromytis,et al. CellFlood: Attacking Tor Onion Routers on the Cheap , 2013, ESORICS.
[174] Julien Bringer,et al. Collusion-Resistant Domain-Specific Pseudonymous Signatures , 2013, NSS.
[175] Roger Dingledine,et al. Blending Different Latency Traffic with Alpha-mixing , 2006, Privacy Enhancing Technologies.
[176] Tyler Moore,et al. Beware the Middleman: Empirical Analysis of Bitcoin-Exchange Risk , 2013, Financial Cryptography.
[177] Abhi Shelat,et al. Efficient Protocols for Set Membership and Range Proofs , 2008, ASIACRYPT.
[178] Yael Tauman Kalai,et al. On the (In)security of the Fiat-Shamir paradigm , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[179] Ian Goldberg,et al. All-but-k Mercurial Commitments and their Applications † , 2012 .
[180] Peter Winkler,et al. Comparing information without leaking it , 1996, CACM.
[181] Nicholas Hopper,et al. Recruiting new tor relays with BRAIDS , 2010, CCS '10.
[182] Injong Rhee,et al. Human Mobility Patterns and Their Impact on Delay Tolerant Networks , 2007, HotNets.
[183] Bingsheng Zhang,et al. A Non-interactive Range Proof with Constant Communication , 2012, Financial Cryptography.
[184] Alex Biryukov,et al. Content and Popularity Analysis of Tor Hidden Services , 2013, 2014 IEEE 34th International Conference on Distributed Computing Systems Workshops (ICDCSW).
[185] Ian H. Witten,et al. The WEKA data mining software: an update , 2009, SKDD.
[186] Mariana Raykova,et al. Outsourcing Multi-Party Computation , 2011, IACR Cryptol. ePrint Arch..
[187] Craig Gentry,et al. Fully homomorphic encryption using ideal lattices , 2009, STOC '09.
[188] Moti Yung,et al. Secure Efficient Multiparty Computing of Multivariate Polynomials and Applications , 2011, ACNS.
[189] Julien Bringer,et al. Efficient and Strongly Secure Dynamic Domain-Specific Pseudonymous Signatures for ID Documents , 2014, Financial Cryptography.
[190] Markus G. Kuhn,et al. Attacks on time-of-flight distance bounding channels , 2008, WiSec '08.
[191] Moni Naor,et al. Visual Cryptography II: Improving the Contrast Via the Cover Base , 1996, Security Protocols Workshop.
[192] Liam McNamara,et al. Media sharing based on colocation prediction in urban transport , 2008, MobiCom '08.
[193] Das Amrita,et al. Mining Association Rules between Sets of Items in Large Databases , 2013 .
[194] Mihir Bellare,et al. A concrete security treatment of symmetric encryption , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[195] Adrian Perrig,et al. Perspectives: Improving SSH-style Host Authentication with Multi-Path Probing , 2008, USENIX Annual Technical Conference.
[196] Brent Waters,et al. Secure Conjunctive Keyword Search over Encrypted Data , 2004, ACNS.
[197] Michael Mitzenmacher,et al. Privacy Preserving Keyword Searches on Remote Encrypted Data , 2005, ACNS.
[198] Lorenz Froihofer,et al. QR-TAN: Secure Mobile Transaction Authentication , 2009, 2009 International Conference on Availability, Reliability and Security.
[199] Manuel Blum,et al. Non-interactive zero-knowledge and its applications , 1988, STOC '88.
[200] Jonathan Katz,et al. Faster Secure Two-Party Computation Using Garbled Circuits , 2011, USENIX Security Symposium.
[201] James Aspnes,et al. Inoculation strategies for victims of viruses and the sum-of-squares partition problem , 2005, SODA '05.
[202] Julien Bringer,et al. Cross-Unlinkable Hierarchical Group Signatures , 2012, EuroPKI.
[203] Ian Goldberg,et al. Constant-Size Commitments to Polynomials and Their Applications , 2010, ASIACRYPT.
[204] Tassos Dimitriou,et al. A Zero Knowledge Proof for Subset Selection from a Family of Sets with Applications to Multiparty/Multicandidate Electronic Elections , 2005, TCGOV.
[205] David Cooper,et al. Internet X.509 Public Key Infrastructure Certificate and Certificate Revocation List (CRL) Profile , 2008, RFC.
[206] Kai Han,et al. Privacy Preserving ID3 Algorithm over Horizontally Partitioned Data , 2005, Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05).
[207] Jan Camenisch,et al. Signature Schemes and Anonymous Credentials from Bilinear Maps , 2004, CRYPTO.
[208] Chris Clifton,et al. An Approach to Securely Identifying Beneficial Collaboration in Decentralized Logistics Systems , 2008, Manuf. Serv. Oper. Manag..
[209] Eyal de Lara,et al. Amigo: Proximity-Based Authentication of Mobile Devices , 2007, UbiComp.
[210] Nicholas Pippenger,et al. On the Evaluation of Powers and Monomials , 1980, SIAM J. Comput..
[211] Geoffrey I. Webb,et al. MultiBoosting: A Technique for Combining Boosting and Wagging , 2000, Machine Learning.
[212] Mihir Bellare,et al. Foundations of garbled circuits , 2012, CCS.
[213] Christian Paquin,et al. U-Prove Cryptographic Specification V1.1 (Revision 3) , 2013 .
[214] Michael K. Reiter,et al. Crowds: anonymity for Web transactions , 1998, TSEC.
[215] Yuval Ishai,et al. Scalable Multiparty Computation with Nearly Optimal Work and Resilience , 2008, CRYPTO.
[216] Peter Schartner,et al. Attacking mTAN-Applications like e-Banking and mobile Signatures , 2010 .
[217] G. Danezis,et al. Denial of Service or Denial of Security? How Attacks on Reliability can Compromise Anonymity , 2007 .
[218] Joshua A. Kroll,et al. The Economics of Bitcoin Mining, or Bitcoin in the Presence of Adversaries , 2013 .
[219] Stefan Savage,et al. Cloak and dagger: dynamics of web search cloaking , 2011, CCS '11.
[220] Hovav Shacham,et al. Group signatures with verifier-local revocation , 2004, CCS '04.
[221] Dawn Xiaodong Song,et al. Practical techniques for searches on encrypted data , 2000, Proceeding 2000 IEEE Symposium on Security and Privacy. S&P 2000.
[222] Sebastian Pape,et al. Authentication in Insecure Environments , 2014, Springer Fachmedien Wiesbaden.
[223] Richard Cleve,et al. Limits on the security of coin flips when half the processors are faulty , 1986, STOC '86.
[224] Lorrie Faith Cranor,et al. Crying Wolf: An Empirical Study of SSL Warning Effectiveness , 2009, USENIX Security Symposium.
[225] Engin Kirda,et al. Quo Vadis? A Study of the Evolution of Input Validation Vulnerabilities in Web Applications , 2011, Financial Cryptography.
[226] Kaoru Kurosawa,et al. How to Update Documents Verifiably in Searchable Symmetric Encryption , 2013, CANS.
[227] Philippe Golle,et al. Reputable Mix Networks , 2004, Privacy Enhancing Technologies.
[228] Fergal Reid,et al. An Analysis of Anonymity in the Bitcoin System , 2011, PASSAT 2011.
[229] Bernd Borchert. Segment-based Visual Cryptography , 2007 .
[230] R. Widlar. An exact expression for the thermal variation of the emitter base voltage of bi-polar transistors , 1967 .
[231] Craig Gentry,et al. Separating succinct non-interactive arguments from all falsifiable assumptions , 2011, IACR Cryptol. ePrint Arch..
[232] Benny Pinkas,et al. Fair Secure Two-Party Computation , 2003, EUROCRYPT.
[233] Aron Laszka,et al. How many down?: toward understanding systematic risk in networks , 2014, AsiaCCS.
[234] D. K. Roveti,et al. Choosing a Humidity Sensor: A Review of Three Technologies This discussion of the operating principles of capacitive, resisitive, and thermal conductivity humidity sensors also addresses their advantages, disadvantages, and applications , 2001 .
[235] Ben Riva,et al. Salus: a system for server-aided secure function evaluation , 2012, CCS.
[236] Helger Lipmaa,et al. On Diophantine Complexity and Statistical Zero-Knowledge Arguments , 2003, ASIACRYPT.
[237] László Lovász,et al. Factoring polynomials with rational coefficients , 1982 .
[238] Fang Yu,et al. Finding the Linchpins of the Dark Web: a Study on Topologically Dedicated Hosts on Malicious Web Infrastructures , 2013, 2013 IEEE Symposium on Security and Privacy.
[239] Yajin Zhou,et al. Dissecting Android Malware: Characterization and Evolution , 2012, 2012 IEEE Symposium on Security and Privacy.
[240] Oded Goldreich,et al. Universal arguments and their applications , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.
[241] Moni Naor,et al. Visual Authentication and Identification , 1997, CRYPTO.
[242] Jacques Traoré,et al. A fair and efficient solution to the socialist millionaires' problem , 2001, Discret. Appl. Math..
[243] Emiliano De Cristofaro,et al. Experimenting with Fast Private Set Intersection , 2012, TRUST.
[244] Paul E. Hoffman,et al. The DNS-Based Authentication of Named Entities (DANE) Transport Layer Security (TLS) Protocol: TLSA , 2012, RFC.
[245] Jonathan Katz,et al. Bridging Game Theory and Cryptography: Recent Results and Future Directions , 2008, TCC.
[246] Yajin Zhou,et al. Hey, You, Get Off of My Market: Detecting Malicious Apps in Official and Alternative Android Markets , 2012, NDSS.
[247] W. Richard Stevens,et al. TCP/IP Illustrated, Volume 1: The Protocols , 1994 .
[248] Charalampos Papamanthou,et al. Dynamic searchable symmetric encryption , 2012, IACR Cryptol. ePrint Arch..
[249] Jeremy Clark,et al. On the Use of Financial Data as a Random Beacon , 2010, EVT/WOTE.
[250] Dan Boneh,et al. Short Signatures Without Random Oracles , 2004, EUROCRYPT.
[251] Philip S. Yu,et al. Classification Spanning Private Databases , 2006, AAAI.
[252] Adi Shamir,et al. Quantitative Analysis of the Full Bitcoin Transaction Graph , 2013, Financial Cryptography.
[253] Adrienne Porter Felt,et al. Alice in Warningland: A Large-Scale Field Study of Browser Security Warning Effectiveness , 2013, USENIX Security Symposium.
[254] Shai Halevi,et al. A Cryptographic Solution to a Game Theoretic Problem , 2000, CRYPTO.
[255] Yehuda Lindell,et al. Complete Fairness in Secure Two-Party Computation , 2011, JACM.
[256] Jan Camenisch,et al. Private Intersection of Certified Sets , 2009, Financial Cryptography.
[257] Hongxia Jin,et al. Private proximity testing with an untrusted server , 2013, WiSec '13.
[258] David Chaum,et al. Blind Signatures for Untraceable Payments , 1982, CRYPTO.
[259] Matthew Green,et al. Zerocoin: Anonymous Distributed E-Cash from Bitcoin , 2013, 2013 IEEE Symposium on Security and Privacy.
[260] Matthew K. Wright,et al. Building Reliable Mix Networks with Fair Exchange , 2005, ACNS.
[261] Ahmad-Reza Sadeghi,et al. TASTY: tool for automating secure two-party computations , 2010, CCS '10.
[262] Alon Rosen,et al. Sequential Rationality in Cryptographic Protocols , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[263] Angelos Stavrou,et al. Exploiting smart-phone USB connectivity for fun and profit , 2010, ACSAC '10.
[264] Xiaomin Liu,et al. Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection , 2009, TCC.
[265] Stephan Sigg,et al. Secure Communication Based on Ambient Audio , 2013, IEEE Transactions on Mobile Computing.
[266] Yehuda Lindell,et al. SCAPI: The Secure Computation Application Programming Interface , 2012, IACR Cryptol. ePrint Arch..