Advanced Search Author|Conference|Journal|Year Look for results that meet for the following criteria: Later than Equal to Earlier than Papers Authors Conferences Journals Top-ranked Papers in "Security and Privacy" Paper Title Indomain-Citations Citations 1 A method for obtaining digital signatures and public-key cryptosystems (1978) 459 2825 2 New Directions in Cryptography (1976) 384 2187 3 Random Oracles are Practical: A Paradigm for Designing Efficient Protocols (1993) 365 926 4 A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks (1988) 342 856 5 Probabilistic Encryption (1984) 317 965 6 Role-Based Access Control Models (1996) 297 1204 7 How to Share a Secret (1979) 281 1355 8 Handbook of applied cryptography (1997) 240 1238 9 A public-key cryptosystem and a signature scheme based on discrete logarithms (1985) 236 903 10 Identity-Based Encryption from the Weil Pairing (2001) 226 809 11 Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms (1981) 209 766 12 How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority (1987) 208 679 13 How To Prove Yourself: Practical Solutions to Identification and Signature Problems (1987) 201 466 14 Handbook of Applied Cryptography (1996) 193 1217 15 On the security of public key protocols (1983) 178 816 16 A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack (1998) 173 386 17 The Knowledge Complexity of Interactive Proof Systems (1989) 169 734 18 Efficient Signature Generation by Smart Cards (1991) 162 409 19 Public-Key Cryptosystems Based on Composite Degree Residuosity Classes (1999) 160 430 20 Using encryption for authentication in large networks of computers (1978) 156 936 21 Relations Among Notions of Security for Public-Key Encryption Schemes (1998) 146 357 22 Universally Composable Security: A New Paradigm for Cryptographic Protocols (2001) 143 371 23 How to construct random functions (1986) 142 518 24 Completeness theorems for non-cryptographic fault-tolerant distributed computation (1988) 140 448 25 Decentralized Trust Management (1996) 133 655 26 Random Oracles are Practical: AParadigm for Designing Efficient Protocols (1995) 127 266 27 Differential Power Analysis (1999) 126 533 28 The Exact Security of Digital Signatures - HOw to Sign with RSA and Rabin (1996) 125 332 29 Security and Composition of Multiparty Cryptographic Protocols (2000) 124 294 30 Security Proofs for Signature Schemes (1996) 122 265 31 Short Signatures from the Weil Pairing (2001) 121 390 32 How to Construct Pseudorandom Permutations from Pseudorandom Functions (1988) 121 278 33 Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR (1996) 117 665 34 Security Arguments for Digital Signatures and Blind Signatures (2000) 116 272 35 Universal one-way hash functions and their cryptographic applications (1989) 115 318 36 Protocols for secure computations (1982) 114 439 37 Nonmalleable Cryptography (2000) 113 254 38 How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits (1984) 109 497 39 Non-malleable cryptography (1991) 108 317 40 Security Policies and Security Models (1982) 108 427 41 Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems (1996) 106 405 42 Authenticated Key Exchange Secure against Dictionary Attacks (2000) 104 249 43 Encrypted Key Exchange: Password-Based Protocols Secure Against Dictionary Attacks (1992) 102 309 44 A Comparison of Commercial and Military Computer Security Policies (1987) 99 372 45 The md4 message-digest algorithm (1992) 99 974 46 A logic of authentication (1990) 99 640 47 Crowds: anonymity for Web transactions (1998) 98 451 48 Public-key Cryptosystems Provably Secure against Chosen Ciphertext Attacks (1990) 98 232 49 A Logic of Authentication (1989) 98 426 50 A Lattice Model of Secure Information Flow (1976) 97 476 51 Keying Hash Functions for Message Authentication (1996) 97 360 52 A Sense of Self for Unix Processes (1996) 95 482 53 Snort: Lightweight Intrusion Detection for Networks (1999) 94 551 54 The Inductive Approach to Verifying Cryptographic Protocols (1998) 93 469 55 How to generate and exchange secrets (1986) 93 373 56 A Randomized Protocol for Signing Contracts (1985) 92 319 57 How to Prove Yourself: Practical Solutions to Identification and Signature Problems (1986) 92 205 58 How to Own the Internet in Your Spare Time (2002) 89 428 59 Protection of information in computer systems (1975) 88 442 60 Lower Bounds for Discrete Logarithms and Related Problems (1997) 88 216 61 Protection in Operating Systems (1976) 88 314 62 A One Round Protocol for Tripartite Diffie-Hellman (2000) 87 275 63 A calculus for access control in distributed systems (1993) 87 289 64 A Concrete Security Treatment of Symmetric Encryption (1997) 87 206 65 How to play ANY mental game (1987) 87 290 66 Identity-Based Cryptosystems and Signature Schemes (1984) 87 377 67 Journal of computer and system sciences (1984) 87 261 68 Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols (1994) 86 199 69 Tor: The Second-Generation Onion Router (2004) 86 332 70 A Practical and Provably Secure Coalition-Resistant Group Signature Scheme (2000) 86 208 71 Proposed NIST standard for role-based access control (2001) 84 371 72 How to exchange secrets by oblivious transfer (1981) 84 283 73 Secure Integration of Asymmetric and Symmetric Encryption Schemes (1999) 84 194 74 Efficient Group Signature Schemes for Large Groups (1997) 84 211 75 Language-based information-flow security (2003) 83 419 76 Linear cryptanalysis method for des cipher (1994) 82 287 77 Blind signatures for untraceable payments (1983) 82 305 78 New Hash Functions and Their Use in Authentication and Set Equality (1981) 82 291 79 Authentication in Distributed Systems: Theory and Practice (1992) 81 389 80 Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels (2001) 80 186 81 Identity-Based Encryption from the Weil Pairing (2003) 80 266 82 The Decision Diffie-Hellman Problem (1998) 79 228 83 StackGuard: Automatic Adaptive Detection and Prevention of Buffer-Overflow Attacks (1998) 79 415 84 Theory and application of trapdoor functions (1982) 77 365 85 Provably secure session key distribution: the three party case (1995) 77 203 86 Handbook of applied cryptography (1997) 76 336 87 Multiparty unconditionally secure protocols (1988) 75 274 88 The Chinese Wall Security Policy (1989) 74 274 89 Role-Based Access Control (1992) 74 355 90 Bro: a system for detecting network intruders in real-time (1999) 74 374 91 Tamper Resistance - a Cautionary Note (1996) 74 354 92 Entity authentication and key distribution (1994) 73 188 93 Authentication and Authenticated Key Exchanges (1992) 73 262 94 Entity Authentication and Key Distribution (1993) 73 217 95 Uses of elliptic curves in cryptography (1986) 73 351 96 Di erential Cryptanalysis of the Data Encryption Standard (1993) 72 211 97 Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations (1997) 72 160 98 An Intrusion-Detection Model (1987) 71 456 99 Proofs that Yield Nothing But Their Validity for All Languages in NP Have Zero-Knowledge Proof Systems (1991) 71 364 100 A paradigm for designing ef cient protocols (1993) 71 120 101 The ARBAC97 Model for Role-Based Administration of Roles (1999) 71 150 102 EMERALD: Event Monitoring Enabling Responses to Anomalous Live Disturbances (1997) 71 312 103 A Sound Type System for Secure Flow Analysis (1996) 70 360 104 Integrity considerations for secure computer systems (1977) 70 250 105 Efficient Selective-ID Secure Identity-Based Encryption Without Random Oracles (2004) 70 162 106 A public key cryptosystem and a signature scheme based on discrete logarithms (1985) 70 189 107 JFlow: Practical Mostly-Static Information Flow Control (1999) 70 328 108 Group Signatures (1991) 70 229 109 Dynamic Taint Analysis for Automatic Detection, Analysis, and SignatureGeneration of Exploits on Commodity Software (2005) 69 237 110 Secure computer system: unified exposition and multics interpretation (1976) 69 331 111 Bro: A System for Detecting Network Intruders in Real-Time (1998) 68 287 112 An improved algorithm for computing logarithms over gf(p) and its cryptographic significance (1978) 68 309 113 Short Group Signatures (2004) 66 166 114 Security Without Identification: Transaction Systems to Make Big Brother Obsolete (1985) 66 259 115 Provably Secure Password-Authenticated Key Exchange Using Diffie-Hellman (2000) 65 143 116 Authenticated Encryption: Relations among Notions and Analysis of the Generic Composition Paradigm (2000) 65 144 117 Designated Verifier Proofs and Their Applications (1996) 65 157 118 Design of a Role-Based Trust-Management Framework (2002) 64 231 119 Short Signatures Without Random Oracles (2004) 64 158 120 Intrusion Detection via Static Analysis (2001) 64 223 121 Cryptography and Data Security (1982) 63 415 122 SDSI -- A Simple Distributed Security Infrastructure (1996) 63 262 123 Differential Cryptanalysis of DES-like Cryptosystems (1991) 63 235 124 A New Public-Key Cryptosystem as Secure as Factoring (1998) 63 149 125 Wallet databases with observers (1993) 63 123 126 The Dining Cryptographers Problem: Unconditional Sender and Recipient Untraceability (1988) 62 269 127 The Sybil Attack (2002) 62 728 128 The tls protocol: version 1 (1999) 61 358 129 Monte carlo methods for index computation mod p (1978) 61 219 130 The Random Oracle Methodology, Revisited (1998) 61 165 131 Efficient Algorithms for Pairing-Based Cryptosystems (2002) 61 252 132 Security architecture for the internet protocol (1998) 60 966 133 Chosen-Ciphertext Security from Identity-Based Encryption (2004) 60 120 134 Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack (1991) 60 148 135 Wallet Databases with Observers (1992) 60 130 136 One-Way Functions are Necessary and Sufficient for Secure Signatures (1990) 60 160 137 A Logical Language for Expressing Authorizations (1997) 60 213 138 Handbook of Applied Cryptography - References (0) 59 186 139 The Byzantine Generals Problem (1982) 59 963 140 Secure Hash-and-Sign Signatures Without the Random Oracle (1999) 59 130 141 The protection of information in computing systems (1975) 59 300 142 Certification of Programs for Secure Information Flow (1977) 58 339 143 Decrypting a Class of Stream Ciphers Using Ciphertext Only (1985) 58 125 144 Minimum Disclosure Proofs of Knowledge (1988) 58 181 145 Identity-based cryptosystems and signature schemes (1985) 58 234 146 Elliptic curve public key cryptosystems (1993) 58 266 147 Timestamps in Key Distribution Protocols (1981) 58 252 148 Bit Commitment Using Pseudorandomness (1991) 58 191 149 Insertion, Evasion, and Denial of Service: Eluding Network Intrusion Detection (1998) 58 212 150 Anonymous Connections and Onion Routing (1998) 58 246 151 A Forward-Secure Public-Key Encryption Scheme (2003) 58 112 152 Inside the Slammer Worm (2003) 58 239 153 Communicating Sequential Processes (1985) 57 3286 154 Proof-Carrying Code (1997) 57 897 155 Zero-Knowledge Proofs of Identity (1988) 57 187 156 A Calculus for Cryptographic Protocols: The spi Calculus (1999) 57 360 157 Private Information Retrieval (1995) 57 227 158 Oblivious Transfer and Polynomial Evaluation (1999) 57 171 159 Chosen Ciphertext Attacks Against Protocols Based on the RSA Encryption Standard PKCS #1 (1998) 57 167 160 On Formal Models for Secure Key Exchange (1999) 57 128 161 Fair Computation of General Functions in Presence of Immoral Majority (1990) 57 164 162 A Model for Asynchronous Reactive Systems and its Application to Secure Message Transmission (2001) 56 147 163 Efficient Proofs that a Committed Number Lies in an Interval (2000) 56 119 164 Resistance against Differential Power Analysis for Elliptic Curve Cryptosystems (1999) 56 139 165 An Identity Based Encryption Scheme Based on Quadratic Residues (2001) 56 153 166 An Efficient Off-line Electronic Cash System Based On The Representation Problem (1993) 55 122 167 Password Authentification with Insecure Communication (1981) 55 335 168 Markov Ciphers and Differentail Cryptanalysis (1991) 55 165 169 A Note on the Confinement Problem (1973) 55 366 170 Linear Cryptoanalysis Method for DES Cipher (1993) 55 171 171 A Forward-Secure Digital Signature Scheme (1999) 55 148 172 Optimistic Fair Exchange of Digital Signatures (1998) 54 135 173 Multicast Security: A Taxonomy and Some Efficient Constructions (1999) 54 249 174 Non-interactive zero-knowledge proof of knowledge and chosen ciphercxt attack (1992) 54 140 175 Hierarchical ID-Based Cryptography (2002) 54 160 176 Non-interactive and information-theoretic secure verifiable secret sharing (1992) 54 134 177 A Secure and Optimally Efficient Multi-Authority Election Scheme (1997) 53 178 178 Elliptic curves in cryptography (1999) 53 322 179 Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing (1991) 53 164 180 Enforceable security policies (2000) 53 278 181 Composition and integrity preservation of secure reactive systems (2000) 53 159 182 The keynote trust management system version 2 (1999) 53 222 183 Practical Threshold Signatures (2000) 53 186 184 On the Importance of Checking Cryptographic Protocols for Faults (1997) 53 197 185 Mimicry attacks on host-based intrusion detection systems (2002) 52 172 186 Signature Schemes Based on the Strong RSA Assumption (1999) 52 109 187 Kerberos: An Authentication Service for Open Network Systems (1988) 52 421 188 Secure Group Communications Using Key Graphs (1998) 52 287 189 Universal Classes of Hash Functions (1979) 52 527 190 Universally composable two-party and multi-party secure computation (2002) 52 111 191 Publicly Verifiable Secret Sharing (1996) 52 142 192 A course in computational algebraic number theory (1993) 52 426 193 Computer security technology planning study (1972) 52 197 194 Inferring internet denial-of-service activity (2001) 52 343 195 Automated Worm Fingerprinting (2004) 51 195 196 Communication theory of secrecy systems (0) 51 410 197 Foundations of cryptography: basic tools (2001) 51 195 198 Verifiable secret sharing and multiparty protocols with honest majority (1989) 51 173 199 Replication is NOT Needed: SINGLE Database, Computationally-Private Information Retrieval (1997) 51 160 200 Impossibility of distributed consensus with one faulty process (1985) 51 1284 201 Founding Cryptography on Oblivious Transfer (1988) 51 195 202 A modular ap-proach to the design and analysis of authentication and key exchange protocols (1998) 50 120 203 Low Cost Attacks on Tamper Resistant Devices (1997) 50 195 204 Robust Threshold DSS Signatures (1996) 50 151 205 Digitalized signatures and public-key functions as intractable as factorization (1979) 50 245 206 Witness Indistinguishable and Witness Hiding Protocols (1990) 50 150 207 Efficient Identity-Based Encryption Without Random Oracles (2005) 50 108 208 State Transition Analysis: A Rule-Based Intrusion Detection Approach (1995) 50 220 209 Detecting Intrusions using System Calls: Alternative Data Models (1999) 50 213 210 A Unified Framework for Enforcing Multiple Access Control Policies (1997) 50 142 211 Signature Schemes and Anonymous Credentials from Bilinear Maps (2004) 50 96 212 How to Leak a Secret (2001) 49 130 213 Lattice-Based Access Control Models (1993) 49 143 214 Secure Distributed Key Generation for Discrete-Log Based Cryptosystems (1999) 49 119 215 Anonymous Connections and Onion Routing (1997) 49 242 216 Aggregate and Verifiably Encrypted Signatures from Bilinear Maps (2003) 49 135 217 Non-Malleable Non-Interactive Zero Knowledge and Adaptive Chosen-Ciphertext Security (1999) 49 120 218 Tarzan: a peer-to-peer anonymizing network layer (2002) 49 218 219 Limits on the Provable Consequences of One-Way Permutations (1989) 49 139 220 Differential Fault Analysis of Secret Key Cryptosystems (1997) 49 146 221 The Security of Cipher Block Chaining (1994) 48 118 222 Prudent Engineering Practice for Cryptographic Protocols (1996) 48 199 223 A key-management scheme for distributed sensor networks (2002) 48 543 224 A Secure Environment for Untrusted Helper Applications (1996) 48 241 225 Privacy-Preserving Data Mining (2000) 48 527 226 Elements of information theory (1991) 48 4461 227 Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations (2000) 48 127 228 On the Security of Joint Signature and Encryption (2002) 48 115 229 Protocols for Public Key Cryptosystems (1980) 48 238 230 Proactive Secret Sharing Or: How to Cope With Perpetual Leakage (1995) 48 189 231 Cryptosystems based on pairing (2000) 48 173 232 Foundations of Cryptography Volume 2: Basic Applications (2004) 48 128 233 E cient Identi cation and Signatures for Smart-Cards (1990) 48 110 234 Universally Composable Commitments (2001) 47 121 235 Computationally Private Information Retrieval with Polylogarithmic Communication (1999) 47 147 236 A Modular Approach to the Design and Analysis of Authentication and Key Exchange Protocols (Extended Abstract) (1998) 47 104 237 Mixminion: Design of a Type III Anonymous Remailer Protocol (2003) 47 124 238 A Calculus for Cryptographic Protocols: The Spi Calculus (1997) 47 364 239 Private Information Retrieval (1998) 47 191 240 How To Withstand Mobile Virus Attacks (1991) 47 171 241 Practical network support for IP traceback (2000) 47 405 242 Chord: A scalable peer-to-peer lookup service for internet applications (2001) 46 3007 243 Role-based access control: features and motivations (1995) 46 144 244 How to Time-Stamp a Digital Document (1991) 46 180 245 A Semantic Model for Authentication Protocols (1993) 46 157 246 Privacy preserving auctions and mechanism design (1999) 46 164 247 RSA-OAEP Is Secure under the RSA Assumption (2001) 46 102 248 Polygraph: Automatically Generating Signatures for Polymorphic Worms (2005) 46 128 249 Efficient Generation of Shared RSA keys (1997) 46 130 250 Automated analysis of cryptographic protocols using Mur-phi (1997) 45 284 251 Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials (2002) 45 103 252 Reasoning about Belief in Cryptographic Protocols (1990) 45 232 253 Autograph: Toward Automated, Distributed Worm Signature Detection (2004) 45 190 254 Configuring role-based access control to enforce mandatory and discretionary access control policies (2000) 45 135 255 Small Solutions to Polynomial Equations, and Low Exponent RSA Vulnerabilities (1997) 45 123 256 A Probabilistic Poly-Time Framework for Protocol Analysis (1998) 45 165 257 New Types of Cryptanalytic Attacks Using Related Keys (1994) 45 99 258 Reducing elliptic curve logarithms to logarithms in a finite field (1993) 45 228 259 Number-theoretic Constructions of Efficient Pseudo-random Functions (1997) 45 160 260 Secure Information Flow in a Multi-Threaded Imperative Language (1998) 45 227 261 Modular multiplication without trial division (1985) 45 357 262 Identity Escrow (1998) 45 98 263 An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation (2001) 44 107 264 Efficient Private Matching and Set Intersection (2004) 44 122 265 Timing attacks on implementations of die-hellman (1996) 44 130 266 A Practical Zero-Knowledge Protocol Fitted to Security Microprocessor Minimizing Both Transmission and Memory (1988) 44 138 267 Intrusion Detection Using Sequences of System Calls (1998) 44 266 268 The Secure Remote Password Protocol (1998) 44 147 269 Secure Multiparty Protocols and Zero-Knowledge Proof Systems Tolerating a Faulty Minority (1991) 44 104 270 A Practical Scheme for Non-interactive Verifiable Secret Sharing (1987) 44 185 271 Optimistic Protocols for Fair Exchange (1997) 44 135 272 Space/Time Trade-offs in Hash Coding with Allowable Errors (1970) 44 1010 273 A practical alternative to hierarchical integrity policies (1985) 44 121 274 Internet Quarantine: Requirements for Containing Self-Propagating Code (2003) 44 223 275 Parallel Collision Search with Cryptanalytic Applications (1999) 43 134 276 A Threshold Cryptosystem without a Trusted Party (Extended Abstract) (1991) 43 102 277 Computers and Intractability: A Guide to the Theory of NP-Completeness (1979) 43 6282 278 Flexible support for multiple access control policies (2001) 43 165 279 Random Key Predistribution Schemes for Sensor Networks (2003) 43 450 280 Blind Signatures for Untraceable Payments (1982) 43 169 281 On the Construction of Pseudorandom Permutations: Luby-Rackoff Revisited (1999) 43 89 282 The SLam Calculus: Programming with Secrecy and Integrity (1998) 43 254 283 The NRL Protocol Analyzer: An Overview (1996) 43 243 284 A First Step Towards Automated Detection of Buffer Overrun Vulnerabilities (2000) 43 319 285 Strong password-only authenticated key exchange (1996) 43 145 286 Universally Composable Notions of Key Exchange and Secure Channels (2002) 43 90 287 Efficient Elliptic Curve Exponentiation Using Mixed Coordinates (1998) 43 129 288 Optimistic fair exchange of digital signatures (2000) 43 112 289 Noninteractive Zero-Knowledge (1991) 43 123 290 Efficient oblivious transfer protocols (2001) 43 118 291 On the Exact Security of Full Domain Hash (2000) 43 90 292 Implementing the Tate Pairing (2002) 43 157 293 The Role Graph Model and Conflict of Interest (1999) 43 114 294 Network intrusion detection (1994) 42 256 295 Securing Ad Hoc Networks (1999) 42 594 296 Optimal asymmetric encryption--how to encrypt with rsa (1995) 42 84 297 How to Generate and Exchange Secrets (Extended Abstract) (1986) 42 204 298 Design and Implementation of a TCG-based Integrity Measurement Architecture (2004) 42 150 299 Optimal Asymmetric Encryption (1994) 42 111 300 Checking for Race Conditions in File Accesses (1996) 42 142 301 Differential Cryptanalysis of the Data Encryption Standard; Springer-Verlag (1993) 42 102 302 Improving host security with system call policies (2003) 42 142 303 On the Composition of Zero-Knowledge Proof Systems (1996) 42 122 304 Finding Collisions in the Full SHA-1 (2005) 42 191 305 A concrete security treatment of symmet-ric encryption: Analysis of the DES modes of operation (1997) 42 116 306 Secure Multi-Party Computation (1998) 42 121 307 Code-Red: a case study on the spread and victims of an internet worm (2002) 41 224 308 Separation of Duty in Role-based Environments (1997) 41 140 309 Access Control Meets Public Key Infrastructure, Or: Assigning Roles to Strangers (2000) 41 154 310 Integrating Flexible Support for Security Policies into the Linux Operating System (2001) 41 170 311 The Block Cipher Square (1997) 41 124 312 Hmac: keyed-hashing for message authentication (1997) 41 393 313 Augmented Encrypted Key Exchange: A Password-Based Protocol Secure against Dictionary Attacks and Password File Compromise (1993) 41 117 314 Concurrent Zero-Knowledge (1998) 41 163 315 Why Johnny Can't Encrypt: A Usability Evaluation of PGP 5.0 (1999) 41 239 316 Pseudorandomness and cryptographic applications (1996) 41 133 317 Distributed Algorithms (1996) 41 1128 318 Alert Correlation in a Cooperative Intrusion Detection Framework (2002) 41 125 319 REACT: Rapid Enhanced-Security Asymmetric Cryptosystem Transform (2001) 41 75 320 A Group Signature Scheme with Improved Efficiency (1998) 41 93 321 Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption (2002) 41 77 322 On the Security of ElGamal Based Encryption (1998) 41 102 323 cryptography: theory and practice (1995) 41 358 324 Towards an Information Theoretic Metric for Anonymity (2002) 41 125 325 A Threshold Cryptosystem without a Trusted Party (1991) 41 112 326 Collision-Free Accumulators and Fail-Stop Signature Schemes Without Trees (1997) 41 84 327 Practical Techniques for Searches on Encrypted Data (2000) 40 136 328 Efficient Password-Authenticated Key Exchange Using Human-Memorable Passwords (2001) 40 85 329 Communication Theory of Secrecy Systems (0) 40 345 330 Privacy Amplification by Public Discussion (1988) 40 156 331 Securing Threshold Cryptosystems against Chosen Ciphertext Attack (1998) 40 74 332 A Practical Mix (1998) 40 91 333 A Data Mining Framework for Building Intrusion Detection Models (1999) 40 223 334 Speeding up the computations on an elliptic curve using addition-subtraction chains (1990) 40 104 335 Vigilante: end-to-end containment of internet worms (2005) 40 145 336 Public Key Encryption with Keyword Search (2004) 40 103 337 A Hierarchy of Authentication Specification (1997) 40 184 338 A Secure Environment for Untrusted Helper Applications (Confining the Wily Hacker) (1996) 40 158 339 How to Break MD5 and Other Hash Functions (2005) 40 134 340 Countering code-injection attacks with instruction-set randomization (2003) 40 150 341 The internet key exchange (ike) (1998) 40 306 342 The Resurrecting Duckling: Security Issues for Ad-hoc Wireless Networks (1999) 40 387 343 A Survey of Fast Exponentiation Methods (1998) 40 150 344 How to Enhance the Security of Public-Key Encryption at Minimum Cost (1999) 40 74 345 An Improved Algorithm for Arithmetic on a Family of Elliptic Curves (1997) 40 97 346 A Role-Based Access Control Model and Reference Implementation within a Corporate Intranet (1999) 40 125 347 Role-based authorization constraints specification (2000) 40 95 348 The Gap-Problems: A New Class of Problems for the Security of Cryptographic Schemes (2001) 39 91 349 Hardening COTS Software with Generic Software Wrappers (1999) 39 127 350 Ariadne: a secure on-demand routing protocol for ad hoc networks (2002) 39 416 351 Address obfuscation: an efficient approach to combat a broad range of memory error exploits (2003) 39 130 352 CCured: type-safe retrofitting of legacy code (2002) 39 274 353 Three System for Cryptographic Protocol Analysis (1994) 39 145 354 The Typed Access Matrix Model (1992) 39 96 355 Pseudonym Systems (1999) 39 83 356 The Security of the Cipher Block Chaining Message Authentication Code (2000) 39 105 357 ISDN-MIXes: Untraceable Communication with Small Bandwidth Overhead (1991) 39 110 358 Fast Algebraic Attacks on Stream Ciphers with Linear Feedback (2003) 38 121 359 A Certified Digital Signature (1989) 38 165 360 Unreliable failure detectors for reliable distributed systems (1996) 38 979 361 Proving in Zero-Knowledge that a Number Is the Product of Two Safe Primes (1999) 38 80 362 A Fair Non-repudiation Protocol (1996) 38 133 363 Fast Portscan Detection Using Sequential Hypothesis Testing (2004) 38 173 364 Security architecture for the internet protocol (1995) 38 346 365 An Attack on the Needham-Schroeder Public-Key Authentication Protocol (1995) 38 229 366 A Hierarchy of Polynomial Time Lattice Basis Reduction Algorithms (1987) 38 149 367 The XTR Public Key System (2000) 38 95 368 Efficient Authentication and Signing of Multicast Streams over Lossy Channels (2000) 38 228 369 Terra: a virtual machine-based platform for trusted computing (2003) 38 185 370 Detecting format-string vulnerabilities with type qualifiers (2001) 38 173 371 Practical Verifiable Encryption and Decryption of Discrete Logarithms (2003) 38 80 372 A Hard-Core Predicate for all One-Way Functions (1989) 38 241 373 The theory of error correcting codes (1977) 37 712 374 Onion Routing for Anonymous and Private Internet Connections (1999) 37 187 375 Protecting Poorly Chosen Secrets from Guessing Attacks (1993) 37 142 376 The Of ficial PGP User''s Guide (1995) 37 225 377 Probabilistic Noninterference for Multi-Threaded Programs (2000) 37 110 378 Separability and Efficiency for Generic Group Signature Schemes (1999) 37 70 379 Analysis of a Denial of Service Attack on TCP (1997) 37 164 380 Cryptanalysis of Block Ciphers with Overdefined Systems of Equations (2002) 37 121 381 Adaptively Secure Multi-Party Computation (1996) 37 106 382 Hiding Routing Information (1996) 37 118 383 Definitions and Properties of Zero-Knowledge Proof Systems (1994) 37 134 384 Factoring integers with elliptic curves (1987) 37 227 385 Towards Sound Approaches to Counteract Power-Analysis Attacks (1999) 37 113 386 Certificate Revocation and Certificate Update (1998) 37 143 387 Simplified VSS and Fact-Track Multiparty Computations with Applications to Threshold Cryptography (1998) 37 100 388 Implementing Fault-Tolerant Services Using the State Machine Approach: A Tutorial (1990) 36 699 389 A model of information (1986) 36 103 390 Throttling Viruses: Restricting propagation to defeat malicious mobile code (2002) 36 149 391 Short Signatures from the Weil Pairing (2004) 36 97 392 A public key cryptosystem and a signature scheme based on discrete logarithms (1985) 36 91 393 Multi-Autority Secret-Ballot Elections with Linear Work (1996) 36 104 394 Security Without Identification: Transaction Systems to Make Big Brother Obsolete (1985) 36 121 395 Fast Batch Verification for Modular Exponentiation and Digital Signatures (1998) 36 86 396 Practical Byzantine Fault Tolerance (1999) 36 401 397 Efficient Software-Based Fault Isolation (1993) 36 578 398 Revocation and Tracing Schemes for Stateless Receivers (2001) 36 106 399 The mathematical theory of communication (0) 36 2946 400 OAEP Reconsidered (2001) 36 105 401 Efficient Communication-Storage Tradeoffs for Multicast Encryption (1999) 36 92 402 Design and Analysis of Practical Public-Key Encryption Scheme Secure against Adaptive Chosen Ciphertext Attack (2003) 36 81 403 On Defining Proofs of Knowledge (1992) 36 97 404 Threshold Cryptosystems (1989) 36 112 405 Password Security - A Case History (1979) 36 160 406 On the (Im)possibility of Obfuscating Programs (2001) 36 146 407 Secure Execution via Program Shepherding (2002) 35 200 408 SPINS: security protocols for sensor netowrks (2001) 35 433 409 On the Formal Definition of Separation-of-Duty Policies and their Composition (1998) 35 82 410 The Specification and Enforcement of Authorization Constraints in Workflow Management Systems (1999) 35 143 411 Digital Signcryption or How to Achieve Cost(Signature & Encryption) << Cost(Signature) + Cost(Encryption) (1997) 35 111 412 A General Theory of Composition for Trace Sets Closed Under SelectiveInterleaving Functions (1994) 35 134 413 Key-Privacy in Public-Key Encryption (2001) 35 78 414 Protecting privacy using the decentralized label model (2000) 35 144 415 Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known (1996) 35 88 416 Shield: vulnerability-driven network filters for preventing known vulnerability exploits (2004) 35 117 417 Athena: A New Efficient Automatic Checker for Security Protocol Analysis (1999) 35 108 418 Secrecy by typing in security protocols (1999) 35 139 419 Signature schemes based on the strong RSA assumption (2000) 35 76 420 Unwinding and Inference Control (1984) 35 124 421 Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions (1999) 35 85 422 The theory of error-correcting codes (1977) 35 539 423 Computer security threat monitoring and surveillance (1980) 35 239 424 Efficient signature generation for smart cards (1991) 35 105 425 Hierarchical Identity Based Encryption with Constant Size Ciphertext (2005) 35 88 426 Anomalous Payload-Based Network Intrusion Detection (2004) 34 138 427 Secure computer systems: unified exposition and multics interpretation (1975) 34 158 428 Proving Properties of Security Protocols by Induction (1997) 34 167 429 Xen and the art of virtualization (2003) 34 606 430 The Design and Implementation of Tripwire: A File System Integrity Checker (1994) 34 125 431 Selecting Cryptographic Key Sizes (2001) 34 165 432 Mixing Email with BABEL (1996) 34 85 433 Correlation-immunity of nonlinear combining functions for cryptographic applications (1984) 34 110 434 Verifiable secret-ballot elections (1987) 34 88 435 A Model of Authorization for Next-Generation Database Systems (1991) 34 146 436 Software Protection and Simulation on Oblivious RAMs (1996) 34 117 437 A Decentralized Model for Information Flow Control (1997) 34 151 438 Mitigating routing misbehavior in mobile ad hoc networks (2000) 34 655 439 Regulating service access and information release on the Web (2000) 34 104 440 A Virtual Machine Introspection Based Architecture for Intrusion Detection (2003) 34 143 441 Proof-Carrying Authentication (1999) 34 136 442 Collusion-Secure Fingerprinting for Digital Data (1995) 34 161 443 Reconciling Two Views of Cryptography (The Computational Soundness of Formal Encryption) (2000) 34 96 444 IRM Enforcement of Java Stack Inspection (2000) 34 133 445 K-anonymity: a model for protecting privacy (2002) 34 387 446 Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes (1992) 34 86 447 Supporting structured credentials and sensitive policies through interoperable strategies for automated trust negotiation (2003) 33 111 448 The Role of Trust Management in Distributed Systems Security (1999) 33 186 449 security engineering: a guide to building dependable distributed systems (2001) 33 306 450 The First Experimental Cryptanalysis of the Data Encryption Standard (1994) 33 120 451 Theory and Applications of Trapdoor Functions (Extended Abstract) (1982) 33 204 452 Easy Come - Easy Go Divisible Cash (1998) 33 81 453 Certificate Chain Discovery in SPKI/SDSI (2001) 33 122 454 How to share a function securely (1994) 33 98 455 E cient selective-ID identity based encryption without random oracles (2004) 33 55 456 Proactive Public Key and Signature Systems (1997) 33 104 457 The NIST model for role-based access control: towards a unified standard (2000) 33 146 458 An Identity-Based Signature from Gap Diffie-Hellman Groups (2003) 33 108 459 A Simplified Approach to Threshold and Proactive RSA (1998) 33 106 460 Public-Key Encryption in a Multi-user Setting: Security Proofs and Improvements (2000) 33 86 461 The Order of Encryption and Authentication for Protecting Communications (or: How Secure Is SSL?) (2001) 33 85 462 An Analysis of the Degradation of Anonymous Protocols (2002) 33 79 463 Kerberos: an authentication service for computer networks (1994) 33 200 464 Automated Detection of Vulnerabilities in Privileged Programs by Execution Monitoring (1994) 33 119 465 The Ponder Policy Specification Language (2001) 33 269 466 Elliptic curves over finite fields and the computation of square roots mod p (1985) 32 153 467 Lov¡§¡Ësz factoring polynomials with rational coefficients (1982) 32 271 468 Reaching Agreement in the Presence of Faults (1980) 32 548 469 Evaluating Intrusion Detection Systems: The 1998 DARPA Off-line Intrusion Detection Evaluation (2000) 32 120 470 SKEME: A Versatile Secure Key Exchange Mechanism for Internet (1996) 32 84 471 PayWord and MicroMint: Two Simple Micropayment Schemes (1996) 32 160 472 Foundations of Group Signatures: Formal Definitions, Simplified Requirements, and a Construction Based on General Assumptions (2003) 32 85 473 The Arithmetic of Elliptic Curves (1986) 32 624 474 Trustee-based Tracing Extensions to Anonymous Cash and the Making of Anonymous Change (1995) 32 78 475 How to Go Beyond the Black-Box Simulation Barrier (2001) 32 128 476 On Monotone Formula Closure of SZK (1994) 32 75 477 A mathematical theory of communications (0) 32 2677 478 Time, clocks, and the ordering of events in a distributed system (1978) 32 2033 479 Studies in Secure Multiparty Computation and Applications (1995) 32 90 480 Comunication and concurrency (1989) 32 2417 481 Efficient Receipt-Free Voting Based on Homomorphic Encryption (2000) 32 118 482 A Signature Scheme with Efficient Protocols (2002) 32 58 483 Transaction Control Expressions For Separation Of Duties (1988) 32 76 484 Specifications for Multi-Level Security and a Hook-Up Property (1987) 32 90 485 New explicit conditions of elliptic curve traces for FR-reduction (2001) 32 103 486 On Span Programs (1993) 32 119 487 A Practical Secret Voting Scheme for Large Scale Elections (1992) 32 147 488 The Base-Rate Fallacy and Its Implications for the Difficulty of Intrusion Detection (1999) 32 84 489 Linux Security Modules: General Security Support for the Linux Kernel (2002) 32 99 490 An Efficient Cryptographic Protocol Verifier Based on Prolog Rules (2001) 32 160 491 Probabilistic Alert Correlation (2001) 32 123 492 Direct anonymous attestation (2004) 32 100 493 The Inductive Approach to Verifying Cryptographic Protocols (2000) 32 126 494 Code red worm propagation modeling and analysis (2002) 32 173 495 Automated Generation and Analysis of Attack Graphs (2002) 32 153 496 Broadcast Encryption (1993) 32 111 497 SD3: A Trust Management System with Certified Evaluation (2001) 31 102 498 The round complexity of secure protocols (1990) 31 86 499 Crowds: Anonymity for Web Transactions (1997) 31 98 500 Casper: A Compiler for the Analysis of Security Protocols (1998) 31 163 501 Security and Composition of Multi-party Cryptographic Protocols (1999) 31 70 502 A Taxonomy of Obfuscating Transformations (1997) 31 168 503 Information flow inference for ML (2002) 31 109 504 Hyperelliptic Cryptosystems (1989) 31 131 505 Priced Oblivious Transfer: How to Sell Digital Goods (2001) 31 75 506 Truncated and Higher Order Differentials (1995) 31 94 507 Aggregation and Correlation of Intrusion-Detection Alerts (2001) 31 105 508 Open Key Exchange: How to Defeat Dictionary Attacks Without Encrypting Public Keys (1997) 31 66 509 Encryption Modes with Almost Free Message Integrity (2001) 31 78 510 Secure group communications using key graphs (2000) 31 198 511 Robustness Principles for Public Key Protocols (1995) 31 117 512 Session-Key Generation Using Human Passwords Only (2001) 31 63 513 Concurrency Control and Recovery in Database Systems (1987) 31 2022 514 A survey of intrusion detection techniques (1993) 31 109 515 Key Agreement in Dynamic Peer Groups (2000) 31 142 516 ReVirt: Enabling Intrusion Analysis Through Virtual-Machine Logging and Replay (2002) 31 198 517 Collision-Resistant Hashing: Towards Making UOWHFs Practical (1997) 31 64 518 How to construct pseudorandom permutations and pseudorandom functions (1988) 31 64 519 Fast Correlation Attacks on Certain Stream Ciphers (1989) 31 84 520 A Proposal for a New Block Encryption Standard (1991) 31 121 521 Secure Identity Based Encryption Without Random Oracles (2004) 31 70 522 A Verifiable Random Function with Short Proofs and Keys (2005) 31 46 523 A network security monitor (1990) 31 107 524 A Fast Automaton-Based Method for Detecting Anomalous Program Behaviors (2001) 30 126 525 GrIDS--A GRAPH BASED INTRUSION DETECTION SYSTEM FOR LARGE NETWORKS (1996) 30 144 526 A classification of security properties for process algebras (1995) 30 107 527 A Cryptographic File System for UNIX (1993) 30 194 528 Key management for multicast: issues and architectures (1997) 30 116 529 The theory of error-correcting codes (north-holland (1977) 30 298 530 The Design of Rijndael: AES - The Advanced Encryption Standard (2002) 30 170 531 OCB: a block-cipher mode of operation for efficient authenticated encryption (2001) 30 100 532 A Fuzzy Commitment Scheme (1999) 30 125 533 A Secure and Reliable Bootstrap Architecture (1997) 30 182 534 Randomized instruction set emulation to disrupt binary code injection attacks (2003) 30 100 535 Protocols for Authentication and Key Establishment (2003) 30 110 536 Toward Hierarchical Identity-Based Encryption (2002) 30 89 537 Freenet: A Distributed Anonymous Information Storage and Retrieval System (2000) 30 531 538 The ssl protocol version 3 (1996) 30 162 539 A pairwise key pre-distribution scheme for wireless sensor networks (2003) 30 288 540 Combinatorial Bounds for Broadcast Encryption (1998) 30 61 541 Key-Insulated Public Key Cryptosystems (2002) 30 66 542 Non-Interactive CryptoComputing For NC1 (1999) 30 62 543 Implementing Pushback: Router-Based Defense Against DDoS Attacks (2002) 30 186 544 Pricing via Processing or Combatting Junk Mail (1992) 30 134 545 Anomaly Detection Using Call Stack Information (2003) 30 111 546 Efficient Arithmetic on Koblitz Curves (2000) 30 94 547 One Way Hash Functions and DES (1989) 30 98 548 Statically Detecting Likely Buffer Overflow Vulnerabilities (2001) 30 149 549 Tracing Traitors (1994) 30 100 550 Receipt-Free Mix-Type Voting Scheme - A Practical Solution to the Implementation of a Voting Booth (1995) 30 95 551 A Pseudorandom Generator from any One-way Function (1999) 30 122 552 More Flexible Exponentiation with Precomputation (1994) 30 91 553 Authenticated encryption: relations among notions and analysis of the generic composition paradigm (1976) 30 68 554 Optimal Resilience Proactive Public-Key Cryptosystems (1997) 30 97 555 MOPS: an infrastructure for examining security properties of software (2002) 30 167 556 UMAC: Fast and Secure Message Authentication (1999) 30 102 557 Building Diverse Computer Systems (1997) 30 140 558 Prudent engineering practice for cryptographic protocols (1994) 29 100 559 Towards Practical Automated Trust Negotiation (2002) 29 82 560 SASI enforcement of security policies: a retrospective (1999) 29 135 561 Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract) (1988) 29 128 562 The Art of Computer Programming (1981) 29 621 563 Untraceable Electronic Cash (1988) 29 105 564 Security Models and Information Flow (1990) 29 110 565 Robust and Efficient Sharing of RSA Functions (1996) 29 79 566 Sequences of Games: A Tool for Taming Complexity in Security Proofs (2004) 29 72 567 CAPTCHA: Using Hard AI Problems for Security (2003) 29 120 568 Analysis and design of stream ciphers (1986) 29 140 569 How to Construct Constant-Round Zero-Knowledge Proof Systems for NP (1996) 29 99 570 Efficient Identification and Signatures for Smart Cards (1989) 29 93 571 Honeycomb - creating intrusion detection signatures using honeypots (2003) 29 107 572 Asynchronous Protocols for Optimistic Fair Exchange (1998) 29 104 573 Efficient and Practical Fair Exchange Protocols with Off-Line TTP (1998) 29 89 574 Security Properties and CSP (1996) 29 124 575 Protecting Data Privacy in Private Information Retrieval Schemes (1998) 29 93 576 Monitoring and early warning for internet worms (2003) 29 131 577 Distributed Credential Chain Discovery in Trust Management (2003) 29 84 578 Strand Spaces: Proving Security Protocols Correct (1999) 29 152 579 Classification And Detection Of Computer Intrusions (1995) 29 137 580 Introduction to Algorithms (1990) 29 3992 581 The Foundations of Cryptography-Volume 2 (2004) 29 87 582 Why Cryptosystems Fail (1994) 29 162 583 Power Analysis Attacks of Modular Exponentiation in Smartcards (1999) 29 56 584 Verifiable Secret Sharing and Multiparty Protocols with Honest Majority (Extended Abstract) (1989) 29 110 585 Mobile values, new names, and secure communication (2001) 29 162 586 Rethinking public key infrastructures and digital certificates: building in privacy (2000) 29 100 587 Establishing pairwise keys in distributed sensor networks (2003) 29 272 588 Some Open Issues and New Directions in Group Signatures (1999) 29 75 589 Secure Agreement Protocols: Reliable and Atomic Group Multicast in Rampart (1994) 29 183 590 A Compact and Fast Hybrid Signature Scheme for Multicast Packet Authentication (1999) 28 75 591 A scalable content-addressable network (2001) 28 2486 592 Talking to Strangers: Authentication in Ad-Hoc Wireless Networks (2002) 28 193 593 Privacy Preserving Data Mining (2000) 28 191 594 Towards an Analysis of Onion Routing Security (2000) 28 51 595 Soundness of Formal Encryption in the Presence of Active Adversaries (2004) 28 97 596 Randomness is Linear in Space (1996) 28 155 597 How to Sign Digital Streams (1997) 28 118 598 Digital Payment Systems with Passive Anonymity-Revoking Trustees (1996) 28 64 599 Lotspiech Revocation and Tracing Schemes for Stateless Receivers (2001) 28 58 600 The design of rijndael (2002) 28 110 601 Manufacturing Cheap, Resilient, and Stealthy Opaque Constructs (1998) 28 113 602 Security-Control Methods for Statistical Databases: A Comparative Study (1989) 28 252 603 Fair Blind Signatures (1995) 28 75 604 Information Flow in Nondeterministic Systems (1990) 28 89 605 Twenty Years of Attacks on the RSA Cryptosystem (1999) 28 117 606 HELLMAN "New Directions in Cryptography (1976) 28 67 607 The knowledge complexity of interactive proof-systems (1985) 28 140 608 Multiparty Computation from Threshold Homomorphic Encryption (2001) 28 63 609 Hash-based IP traceback (2001) 28 275 610 Transparent Run-Time Defense Against Stack-Smashing Attacks (2000) 28 154 611 Constructing attack scenarios through correlation of intrusion alerts (2002) 28 80 612 Provably Secure Blind Signature Schemes (1996) 28 69 613 Foundations of Secure Interactive Computing (1991) 28 93 614 Transforming Out Timing Leaks (2000) 28 107 615 Security Analysis of a Practical "on the fly" Authentication and Signature Generation (1998) 28 50 616 Computing in the Jacobian of a hyperelliptic curve (1987) 28 139 617 Delegation logic: A logic-based approach to distributed authorization (2003) 28 144 618 The Boomerang Attack (1999) 28 75 619 Protecting Mobile Agents Against Malicious Hosts (1998) 27 258 620 Weaknesses in the Key Scheduling Algorithm of RC4 (2001) 27 213 621 A Meta-Notation for Protocol Analysis (1999) 27 151 622 Scalable Protocols for Authenticated Group Key Exchange (2003) 27 73 623 Very Fast Containment of Scanning Worms (2004) 27 110 624 Implementing a distributed firewall (2000) 27 129 625 Provably authenticated group Diffie-Hellman key exchange (2001) 27 84 626 Noninterference, Transitivity and Channel-Control Security Policies (1992) 27 69 627 Untraceable Off-line Cash in Wallets with Observers (1993) 27 62 628 Simplified OAEP for the RSA and Rabin Functions (2001) 27 59 629 Using Hash Functions as a Hedge against Chosen Ciphertext Attack (2000) 27 79 630 How to 0wn the Internet in Your Spare Time (2002) 27 81 631 A Framework for Password-Based Authenticated Key Exchange (2003) 27 49 632 Signature schemes with e cient pro-tocols (2002) 27 45 633 A Proposal for an ISO Standard for Public Key Encryption (version 2.1) (2001) 27 67 634 One Way Hash Functions and DES (1990) 27 103 635 A veri able secret shu e and its application to e-voting (2001) 27 63 636 Optimal asymmetric encryption| how to encrypt with RSA (1994) 27 68 637 Attribute-based encryption for fine-grained access control of encrypted data (2006) 27 65 638 A Semantics for a Logic of Authentication (1991) 27 142 639 Mutual exclusion of roles as a means of implementing separation of duty in role-based access control systems (1997) 27 58 640 Zero Knowledge Proofs of Knowledge in Two Rounds (1989) 27 67 641 Extensible Security Architecture for Java (1997) 27 191 642 Transparent Runtime Randomization for Security (2003) 27 84 643 A fair protocol for signing contracts (1990) 27 81 644 From a Trickle to a Flood: Active Attacks on Several Mix Types (2002) 27 64 645 Architectural Support for Copy and Tamper Resistant Software (2000) 27 219 646 Secure spread spectrum watermarking for multimedia (1997) 27 747 647 OceanStore: an architecture for global-scale persistent storage (2000) 27 970 648 On Certificate Revocation and Validation (1998) 27 89 649 Secure program execution via dynamic information flow tracking (2004) 27 162 650 The Security of the Cipher Block Chaining Message Authentication Code (1994) 26 43 651 Forward-Secure Signatures with Optimal Signing and Verifying (2001) 26 71 652 Simple and fault-tolerant key agreement for dynamic collaborative groups (2000) 26 148 653 Analysis and design of cryptographic hash functions (1993) 26 100 654 New Block Encryption Algorithm MISTY (1997) 26 76 655 A new traitor tracing (2002) 26 48 656 Self-Certified Public Keys (1991) 26 85 657 Cryptanalysis of Skipjack Reduced to 31 Rounds Using Impossible Differentials (1999) 26 66 658 Introducing MorphMix: peer-to-peer based anonymous Internet usage with collusion detection (2002) 26 82 659 Detecting Computer and Network Misuse through the Production-based Expert System Toolset (P-BEST) (1999) 26 96 660 A Key Recovery Attack on Discrete Log-based Schemes Using a Prime Order Subgroupp (1997) 26 68 661 Prudent Engineering Practice for Cryptographic Protocols (1995) 26 108 662 The LSD Broadcast Encryption Scheme (2002) 26 71 663 Diffie-Hellman Key Distribution Extended to Group Communication (1996) 26 162 664 Time-lock puzzles and timed-release Crypto (1996) 26 80 665 Public-Key Cryptography and Password Protocols (1999) 26 57 666 Network intrusion detection: evasion, traffic normalization, and end-to-end protocol semantics (2001) 26 101 667 Access Rights Administration in Role-Based Security Systems (1994) 26 56 668 Efficient Trace and Revoke Schemes (2000) 26 39 669 Fault tolerant anonymous channel (1997) 26 49 670 Foundations of Cryptography Volume 1-Basic Tools (2001) 26 96 671 A verifiable secret shuffle and its application to e-voting (2001) 26 55 672 Using client puzzles to protect tls (2001) 26 104 673 Finding Collisions on a One-Way Street: Can Secure Hash Functions Be Based on General Assumptions? (1998) 26 62 674 Efficient and Generalized Group Signatures (1997) 26 70 675 Pointguard: protecting pointers from buffer overflow vulnerabilities (2003) 26 120 676 Data Mining Approaches for Intrusion Detection (1998) 26 242 677 On-Line/Off-Line Digital Signatures (1996) 26 56 678 On Models of Protection in Operating Systems (1975) 26 54 679 NetSTAT: A Network-based Intrusion Detection System (1999) 26 92 680 Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer (1997) 26 543 681 Construction of pseudorandom generator from any one-way function (1999) 26 83 682 Secure Computer Systems: Mathematical Foundations (1973) 26 127 683 New directions in cryptography (1976) 26 109 684 Making Mix Nets Robust for Electronic Voting by Randomized Partial Checking (2002) 26 90 685 Using Programmer-Written Compiler Extensions to Catch Security Holes (2002) 26 102 686 The Discrete Logarithm Problem on Elliptic Curves of Trace One (1999) 26 94 687 A modular approach to composing access control policies (2000) 26 50 688 Undeniable Signatures (1989) 26 69 689 Java Security: From HotJava to Netscape and Beyond (1996) 26 189 690 Certificateless Public Key Cryptography (2003) 26 99 691 How to share a secret (1979) 25 167 692 Compliance Checking in the PolicyMaker Trust Management System (1998) 25 105 693 How to Protect DES Against Exhaustive Key Search (1996) 25 69 694 Obfuscation of executable code to improve resistance to static disassembly (2003) 25 108 695 Imposslbihty of distributed consensus w~th one faulty process (1985) 25 407 696 Exposure-Resilient Functions and All-or-Nothing Transforms (2000) 25 49 697 SOS: secure overlay services (2002) 25 229 698 Pastry: Scalable distributed object location and routing for large-scale peer-to-peer systems (2001) 25 1313 699 A new public key cryptosystem based on higher residues (1998) 25 68 700 Key Establishment in Large Dynamic Groups Using One-Way Function Trees (1998) 25 101 701 An Authorization Mechanism for a Relational Database System (1976) 25 109 702 The MD4 message digest algorithm (1991) 25 102 703 Holding Intruders Accountable on the Internet (1995) 25 92 704 Conditionally-Perfect Secrecy and a Provably-Secure Randomized Cipher (1992) 25 63 705 Zero-Knowledge Undeniable Signatures (1990) 25 46 706 Universal Composition with Joint State (2003) 25 52 707 Separating Decision Diffie-Hellman from Diffie-Hellman in cryptographic groups (2001) 25 71 708 Practical safety in flexible access control models (2001) 25 47 709 Collusion-Secure Fingerprinting for Digital Data (1998) 25 139 710 Public-Key Cryptography and Password Protocols (1998) 25 50 711 Advanced and Authenticated Marking Schemes for IP Traceback (2001) 25 205 712 Chosen-Ciphertext Security for Any One-Way Cryptosystem (2000) 25 46 713 Towards Automatic Generation of Vulnerability-Based Signatures (2006) 25 73 714 Taint - Enhanced Policy Enforcement: A Practical Approach to Defeat a Wide Range of Attacks (2006) 25 76 715 A composable cryptographic library with nested operations (2003) 25 92 716 Veri able secret sharing and achieving simultaneity in the presence of faults (1985) 25 93 717 Secret sharing scheme realizing general access structure (1987) 25 116 718 A Survey of Authentication Protocol Literature: Version 1.0 (1997) 25 131 719 Non-interactive zero-knowledge and its applications (1988) 25 68 720 On the effectiveness of address-space randomization (2004) 25 90 721 Fairplay | a secure two-party computation system (2004) 25 79 722 Towards an Analysis of Onion Routing Security (2000) 25 55 723 Constructing digital signatures from a one-v~ray function (1979) 25 98 724 Speeding the pollard and elliptic curve methods of factorization (1987) 25 144 725 Provably Authenticated Group Diffie-Hellman Key Exchange - The Dynamic Case (2001) 25 78 726 Mix-Networks on Permutation Networks (1999) 25 47 727 A "Paradoxical" Indentity-Based Signature Scheme Resulting from Zero-Knowledge (1988) 25 55 728 On data banks and privacy homomorphisms (1978) 25 105 729 Testing Intrusion detection systems: a critique of the 1998 and 1999 DARPA intrusion detection system evaluations as performed by Lincoln Laboratory (2000) 25 118 730 The SRI IDES Statistical Anomaly Detector (1991) 25 99 731 Direct chosen ciphertext security from identity-based techniques (2005) 25 48 732 Semantics and Program Analysis of Computationally Secure Information Flow (2001) 25 72 733 Modelling a Public-Key Infrastructure (1996) 25 119 734 Efficient non-transferable anonymous multi-show credential system with optional anonymity revocation (2001) 24 57 735 Limiting the Disclosure of Access Control Policies during Automated Trust Negotiation (2001) 24 81 736 Some new attacks upon security protocols (1996) 24 90 737 Strand Spaces: Why is a Security Protocol Correct? (1998) 24 102 738 Cyclone: A Safe Dialect of C (2002) 24 251 739 Role templates for content-based access control (1997) 24 52 740 Towards a taxonomy of intrusion-detection systems (1999) 24 122 741 Verifying Authentication Protocols in CSP (1998) 24 97 742 Group Signature Schemes and Payment Systems Based on the Discrete Logarithm Problem (1998) 24 61 743 Receipt-free secret-ballot elections (1994) 24 97 744 Fast Key Exchange with Elliptic Curve Systems (1995) 24 90 745 The Anatomy of the Grid: Enabling Scalable Virtual Organizations (2001) 24 1824 746 Efficient Private Bidding and Auctions with an Oblivious Third Party (1999) 24 73 747 Iolus: A Framework for Scalable Secure Multicasting (1997) 24 229 748 Secure computer systems: mathematical foundations and model (1973) 24 126 749 Security problems in the TCP/IP protocol suite (1989) 24 226 750 Number Theoretic Attacks on Secure Password Schemes (1997) 24 54 751 Cryptographic Protocols Provably Secure Against Dynamic Adversaries (1992) 24 49 752 A Core Calculus of Dependency (1999) 24 169 753 A public key cryptosystem based on algebraic coding theory (1978) 24 113 754 Securing context-aware applications using environment roles (2001) 24 111 755 Going Beyond the Sandbox: An Overview of the New Security Architecture in the Java Development Kit 1.2 (1997) 24 144 756 Tamper Resistant Software: An Implementation (1996) 24 101 757 History-Based Access Control for Mobile Code (1998) 24 82 758 Player Simulation and General Adversary Structures in Perfect Multiparty Computation (2000) 24 82 759 Distributed Provers with Applications to Undeniable Signatures (1991) 24 70 760 Key Agreement Protocols and Their Security Analysis (1997) 24 91 761 Automatically Hardening Web Applications Using Precise Tainting (2005) 24 83 762 Integrity considerations for secure computer systems (1975) 24 71 763 Public Quadratic Polynominal-Tuples for Efficient Signature-Verification and Message-Encryption (1988) 24 62 764 Authentication in the Taos Operating System (1994) 24 121 765 Backwards-Compatible Bounds Checking for Arrays and Pointers in C Programs (1997) 24 131 766 Computer Immunology (1997) 24 176 767 Efficient and Secure Source Authentication for Multicast (2001) 24 189 768 Intrusion Detection Using Variable-Length Audit Trail Patterns (2000) 24 57 769 RIPEMD-160: A Strengthened Version of RIPEMD (1996) 24 64 770 Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data (2004) 24 100 771 Non-Cryptographic Fault-Tolerant Computing in Constant Number of Rounds of Interaction (1989) 24 68 772 Finding Small Roots of Univariate Modular Equations Revisited (1997) 24 67 773 A cryptanalytic time-memory trade-off (1980) 24 89 774 A New Forward-Secure Digital Signature Scheme (2000) 24 54 775 The UCONABC usage control model (2004) 24 88 776 Automated Analysis of Cryptographic Protocols Using (1997) 24 109 777 Perfectly Secure Message Transmission (1993) 24 95 778 A Security Architecture for Computational Grids (1998) 24 531 779 Probabilistic Encryption and How to Play Mental Poker Keeping Secret All Partial Information (1982) 24 80 780 The S/KEY One-Time Password System (1994) 24 111 781 Fuzzy Identity-Based Encryption (2005) 24 55 782 Binder, a Logic-Based Security Language (2002) 24 68 783 A Simple Unpredictable Pseudo-Random Number Generator (1986) 24 136 784 On SDSI's Linked Local Name Spaces (1998) 24 63 785 Robust Non-interactive Zero Knowledge (2001) 24 61 786 LFSR-based Hashing and Authentication (1994) 24 73 787 Experience with EMERALD to Date (1999) 24 107 788 Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme (2003) 24 53 789 Role Hierarchies and Constraints for Lattice-Based Access Controls (1996) 24 63 790 A certified digital signature (1990) 23 85 791 Protection - principles and practices (1972) 23 101 792 CBC MAC for Real-Time Data Sources (2000) 23 49 793 Towards Measuring Anonymity (2002) 23 72 794 A framework for constructing features and models for intrusion detection systems (2000) 23 137 795 CBC MACs for Arbitrary-Length Messages: The Three-Key Constructions (2000) 23 64 796 Task-Based Authorization Controls (TBAC): A Family of Models for Active and Enterprise-Oriented Autorization Management (1997) 23 67 797 Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys (2005) 23 59 798 Efficient and Timely Mutual Authentication (1987) 23 106 799 Strong Authentication for RFID Systems Using the AES Algorithm (2004) 23 125 800 Access control: principle and practice (1994) 23 145 801 Limits of Anonymity in Open Environments (2002) 23 42 802 Applied cryptography second edition: protocols (1996) 23 122 803 The Interpolation Attack on Block Ciphers (1997) 23 87 804 Panorama: capturing system-wide information flow for malware detection and analysis (2007) 23 44 805 A Type-Based Approach to Program Security (1997) 23 147 806 Modelling and verifying key-exchange protocols using CSP and FDR (1995) 23 118 807 Perfect Non-interactive Zero Knowledge for NP (2006) 23 37 808 Electromagnetic Analysis: Concrete Results (2001) 23 89 809 Hidden Credentials (2003) 23 59 810 RSA and Rabin Functions: Certain Parts are as Hard as the Whole (1988) 23 81 811 Low-Cost Traffic Analysis of Tor (2005) 23 67 812 A General Theory of Security Properties (1997) 23 68 813 The keynote trust management system (1999) 23 88 814 Practical Protocols for Certified Electronic Mail (1996) 23 80 815 Password-Authenticated Key Exchange Based on RSA (2000) 23 43 816 Symmetric Encryption in a Simulatable Dolev-Yao Style Cryptographic Library (2004) 23 55 817 Role-based access control (2003) 23 103 818 SPINS: Security Protocols for Sensor Networks (2002) 23 293 819 Constraint solving for bounded-process cryptographic protocol analysis (2001) 23 152 820 MMH: Software Message Authentication in the Gbit/Second Rates (1997) 23 58 821 The battle against phishing: Dynamic Security Skins (2005) 23 100 822 A secure and e cient conference key distribution system (1994) 23 113 823 Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms (1996) 23 61 824 Security and Privacy Aspects of Low-Cost Radio Frequency Identification Systems (2003) 23 146 825 Complete characterization of security notions for probabilistic private-key encryption (2000) 23 47 826 Divertible Protocols and Atomic Proxy Cryptography (1998) 23 54 827 Universally Verifiable Mix-net with Verification Work Indendent of the Number of Mix-servers (1998) 23 54 828 Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes (1998) 23 61 829 Factoring polynomials with rational coe - cients (1982) 23 182 830 Techniques for Data Hiding (1996) 23 288 831 NTRU: A Ring-Based Public Key Cryptosystem (1998) 23 99 832 The Notion of Security for Probabilistic Cryptosystems (1988) 23 88 833 Traceable Signatures (2004) 23 43 834 Directed-Graph Epidemiological Models of Computer Viruses (1991) 23 133 835 Reducing Risks from Poorly Chosen Keys (1989) 22 68 836 "Foiling the Cracker": A Survey of, and Improvements to, Password Security (1990) 22 81 837 Timed Commitments (2000) 22 46 838 Tracing traitors (2000) 22 50 839 Semantics-Aware Malware Detection (2005) 22 83 840 Compact E-Cash (2005) 22 42 841 Seeing-Is-Believing: Using Camera Phones for Human-Verifiable Authentication (2005) 22 81 842 The gap-problems: A new class of problems for the security of cryptographic schemes (1992) 22 53 843 Tweakable Block Ciphers (2002) 22 59 844 An Access Control Model Supporting Periodicity Constraints and Temporal Reasoning (1998) 22 88 845 Execution Monitoring of Security-Critical Programs in Distributed Systems: A Specification-Based Approach (1997) 22 115 846 Client Puzzles: A Cryptographic Countermeasure Against Connection Depletion Attacks (1999) 22 115 847 A Virtual Honeypot Framework (2004) 22 110 848 Formalizing Sensitivity in Static Analysis for Intrusion Detection (2004) 22 55 849 Secret Handshakes from Pairing-Based Key Agreements (2003) 22 70 850 All-or-Nothing Encryption and the Package Transform (1997) 22 68 851 Detecting Manipulated Remote Call Streams (2002) 22 64 852 Analysis of the SSL 3.0 protocol (1996) 22 72 853 An Authorization Model for Workflows (1996) 22 68 854 Remote Timing Attacks are Practical (2003) 22 77 855 MDx-MAC and Building Fast MACs from Hash Functions (1995) 22 66 856 Secure computer system: un -: fled exposition and multics interpretation (1974) 22 72 857 Learning Program Behavior Profiles for Intrusion Detection (1999) 22 111 858 Jif: java information flow (2001) 22 63 859 Packet Leashes: A Defense against Wormhole Attacks in Wireless Networks (2003) 22 261 860 Formal Models for Computer Security (1981) 22 165 861 One-way functions are essential for complexity based cryptography (1989) 22 68 862 An Efficient Public Key Traitor Tracing Scheme (1999) 22 58 863 Sharing Decryption in the Context of Voting or Lotteries (2000) 22 50 864 On blind signatures and perfect crimes (1992) 22 57 865 Secure Information Flow and Pointer Confinement in a Java-like Language (2002) 22 87 866 REFEREE: Trust Management for Web Applications (1997) 22 108 867 Two Practical and Provably Secure Block Ciphers: BEARS and LION (1996) 22 50 868 On Unifying Some Cryptographic Protocol Logics (1994) 22 130 869 ElectroMagnetic Analysis (EMA): Measures and Counter-Measures for Smart Cards (2001) 22 94 870 Improved Online/Offline Signature Schemes (2001) 22 53 871 Efficient Collision Search Attacks on SHA-0 (2005) 22 68 872 Privacy Preserving Data Mining (2002) 22 140 873 Oblivious signature-based envelope (2003) 22 53 874 Paillier's cryptosystem revisited (2001) 22 43 875 The kerberos network authentication service (v5) (1993) 22 200 876 Understanding Java Stack Inspection (1998) 22 101 877 KeyNote: Trust Management for Public-Key Infrastructures (1998) 22 80 878 SIGMA: The 'SIGn-and-MAc' Approach to Authenticated Diffie-Hellman and Its Use in the IKE-Protocols (2003) 22 48 879 New group signature schemes (1995) 22 54 880 How to Break a Practical MIX and Design a New One (2000) 22 62 881 Strong Key-Insulated Signature Schemes (2003) 22 40 882 A secure and efficient conference key distribution system (1995) 22 66 883 TRBAC: A temporal role-based access control model (2001) 22 81 884 Formatguard: automatic protection from printf format string vulnerabilities (2001) 22 98 885 A taxonomy of computer worms (2003) 22 107 886 Security of blind digital signatures (1997) 22 30 887 Synthesizing Fast Intrusion Prevention/Detection Systems from High-Level Specifications (1999) 22 60 888 Smashing the stack for fun and profit (1996) 22 118 889 Differential Collisions in SHA-0 (1998) 22 66 890 Plaintext Awareness via Key Registration (2003) 22 39 891 Efficient Identity Based Signature Schemes Based on Pairings (2002) 22 93 892 Accurate Buffer Overflow Detection via Abstract Payload Execution (2002) 22 51 893 Untraceable Off-line Cash in Wallet with Observers (1993) 22 55 894 Non-control-data attacks are realistic threats (2005) 22 67 895 Randomized Algorithms (1995) 22 1288 896 Incremental Cryptography: The Case of Hashing and Signing (1994) 21 63 897 Long-Lived Broadcast Encryption (2000) 21 49 898 Some Conundrums Concerning Separation of Duty (1990) 21 58 899 Towards Realizing Random Oracles: Hash Functions That Hide All Partial Information (1997) 21 57 900 Cryptography: a new dimension in computer data security (1982) 21 49 901 Efficient Context-Sensitive Intrusion Detection (2004) 21 58 902 Copilot - a Coprocessor-based Kernel Runtime Integrity Monitor (2004) 21 69 903 Rackoff the knowledge complexity of interactive proof systems (1989) 21 57 904 A Proof of Yao's Protocol for Secure Two-Party Computation (2004) 21 34 905 Non-interference and the composibility of security properties (1988) 21 77 906 Naming and Grouping Privileges to Simplify Security Management in Large Databases (1990) 21 53 907 The security of the cipher block chaining message authentication code (1994) 21 36 908 Secure routing in wireless sensor networks: attacks and countermeasures (2003) 21 297 909 A proposal for an ISO standard for public key encryption (2001) 21 60 910 A Requires/Provides Model for Computer Attacks (2000) 21 66 911 End-To-End Arguments in System Design (1984) 21 852 912 Valuation of Trust in Open Networks (1994) 21 164 913 Cryptanalysis of short RSA secret exponents (1990) 21 98 914 A spectral characterization of correlation-immune combining functions (1988) 21 58 915 Database Security (1995) 21 105 916 Refinement and Extension of Encrypted Key Exchange (1995) 21 75 917 The random oracle methodology (1998) 21 54 918 Authorizations in Distributed Systems: A New Approach (1993) 21 68 919 Network layer protocols with byzantine robustness (1988) 21 156 920 Computers and Interactability: A Guide to the Theory of NP - Compeltenesa (1979) 21 1537 921 Using First-Order Logic to Reason about Policies (2003) 21 68 922 CSP and determinism in security modelling (1995) 21 68 923 A Graph-based System for Network-vulnerability Analysis (1998) 21 78 924 Cryptanalysis of Stream Ciphers with Linear Masking (2002) 21 40 925 How to construct random functions (1984) 21 106 926 Learning Patterns from Unix Process Execution Traces for Intrusion Detection (1997) 21 86 927 A Role-based Trust-management Framework (2003) 21 87 928 Simple forward-secure signatures from any signature scheme (2000) 21 60 929 Evaluating 2-DNF Formulas on Ciphertexts (2005) 21 41 930 Optimistic Protocols for Fair Exchange (1996) 21 53 931 What do We Mean by Entity Authentication? (1996) 21 68 932 Cryptography and computer privacy (1973) 21 132 933 System Architecture Directions for Networked Sensors (2000) 21 1443 934 Scalable, graph-based network vulnerability analysis (2002) 21 69 935 An Architecture for Intrusion Detection Using Autonomous Agents (1998) 21 136 936 The RC5 Encryption Algorithm (1995) 21 150 937 A New Type System for Secure Information Flow (2001) 21 71 938 Intercepting mobile communications: the insecurity of 802.11 (2001) 21 234 939 Zaps and Their Applications (2000) 21 42 940 Efficient dispersal of information for security, load balancing, and fault tolerance (1989) 21 399 941 The Two Faces of Lattices in Cryptology (2001) 21 61 942 Encryption Modes with Almost Free Message Integrity (2000) 21 67 943 Secure Routing for Structured Peer-to-Peer Overlay Networks (2002) 21 227 944 A Uniform-Complexity Treatment of Encryption and Zero-Knowledge (1993) 21 61 945 On the Importance of Eliminating Errors in Cryptographic Computations (2001) 21 52 946 Reflections on Trusting Trust (1984) 21 150 947 A Digital Signature Based on a Conventional Encryption Function (1987) 21 97 948 Bucket Hashing and its Application to Fast Message Authentication (1995) 21 47 949 Pseudo-random generation from one-way functions (1989) 21 97 950 Design Patterns: Elements of Reusable Object-Oriented Software (1995) 21 4652 951 An Architecture for Practical Delegation in a Distributed System (1990) 21 96 952 Improved Efficiency for CCA-Secure Cryptosystems Built Using Identity-Based Encryption (2005) 21 45 953 XML document security based on provisional authorization (2000) 21 120 954 Modeling the Spread of Active Worms (2003) 21 139 955 A Hierarchy of Authentication Specifications (1996) 21 55 956 Generalized privacy amplification (1995) 21 68 957 Attacks on Copyright Marking Systems (1998) 21 257 958 Framework for Role-based Delegation Models (2000) 21 56 959 Elliptic Curves And Primality Proving (1993) 21 121 960 The nides statistical component description and justification (1994) 21 61 961 A Calculus for Access Control in Distributed Systems (1991) 20 59 962 EROS: a fast capability system (1999) 20 143 963 Global Intrusion Detection in the DOMINO Overlay System (2004) 20 97 964 Comparing Information Without Leaking It (1996) 20 49 965 Provable secure and practical identi cation schemes and corre-sponding signature schemes (1993) 20 52 966 ID-based Signatures from Pairings on Elliptic Curves (2002) 20 88 967 Undermining an Anomaly-Based Intrusion Detection System Using Common Exploits (2002) 20 52 968 Probabilistic Noninterference in a Concurrent Language (1999) 20 53 969 Safe Kernel Extensions Without Run-Time Checking (1996) 20 395 970 Secure Communications Over Insecure Channels (1978) 20 116 971 Public-Key Cryptosystems Based on Discrete Logarithms Residues (1999) 20 30 972 Software Watermarking: Models and Dynamic Embeddings (1999) 20 81 973 Secure computer systems: mathematical foundations and model (1974) 20 68 974 Communication preserving protocols for secure function evaluation (2001) 20 63 975 Static analysis of executables to detect malicious patterns (2003) 20 89 976 Anonymous Identification in Ad Hoc Groups (2004) 20 39 977 Bimodal Multicast (1999) 20 322 978 Differential Cryptanalysis of the full 16-round DES (1993) 20 63 979 The Compositional Security Checker: A Tool for the Verification of Information Flow Security Properties (1997) 20 122 980 Collision-free accumulators and fail-stop signa-ture schemes without trees (1997) 20 44 981 An introduction to the theory of numbers (1979) 20 563 982 Chameleon Signatures (2000) 20 38 983 NetSTAT: A Network-Based Intrusion Detection Approach (1998) 20 75 984 Cryptanalysis of MD4 (1996) 20 52 985 Firewalls and internet security: repelling the wily hacker (1994) 20 122 986 The use of elliptic curves in cryptography (1986) 20 64 987 Using CQUAL for Static Analysis of Authorization Hook Placement (2002) 20 47 988 On the (In)security of the Fiat-Shamir Paradigm (2003) 20 47 989 Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults (Extended Abstract) (1985) 20 79 990 Introduction to probability theory and its applications (1968) 20 1131 991 A multifaceted approach to understanding the botnet phenomenon (2006) 20 78 992 The Oracle Diffie-Hellman Assumptions and an Analysis of DHIES (2001) 20 49 993 Analysis of the Internet Key Exchange Protocol using the NRL Protocol Analyzer (1999) 20 80 994 Flexible Policy-Directed Code Safety (1999) 20 129 995 KeyNote: Trust Management for Public-Key Infrastructures (Position Paper) (1998) 20 47 996 Advanced Compiler Design and Implementation (1997) 20 950 997 Guide to Elliptic Curve Cryptography (2004) 20 165 998 An E¡¾cient Scheme for Proving a Shu2e (2001) 20 48 999 Minos: Control Data Attack Prevention Orthogonal to Memory Model (2004) 20 95 1000 Role-Based Access Control (1997) 20 34 1 2 3 4 5 6 7 8 9 NextMicrosoft Research Asia | Help | Feedback | Specific Terms ¨Ï2009 Microsoft Corporation. All rights reserved. Contact Us | Terms of Use | Trademarks | Privacy Statement