default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID1st CCS 1993: Fairfax, Virginia, USA
- Dorothy E. Denning, Raymond Pyle, Ravi Ganesan, Ravi S. Sandhu, Victoria Ashby:
CCS '93, Proceedings of the 1st ACM Conference on Computer and Communications Security, Fairfax, Virginia, USA, November 3-5, 1993. ACM 1993, ISBN 0-89791-629-8 - Ralf C. Hauser:
Does Licensing Require New Access Control Techniques? 1-8 - Matt Blaze:
A Cryptographic File System for UNIX. 9-16 - Miguel Soriano, Jordi Forné
, Francisco Recacha, José L. Melús:
A Particular Solution to Provide Secure Communications in an Ethernet Environment. 17-25 - Li Gong:
Lower Bounds on Messages and Rounds for Network Authentication Protocols. 26-37 - Raphael Yahalom:
Optimality of Multi-Domain Protocols. 38-48 - Gene Tsudik, Els Van Herreweghen:
On Simple and Secure Key Distribution. 49-57 - Kaisa Nyberg, Rainer A. Rueppel:
A New Signature Scheme Based on the DSA Giving Message Recovery. 58-61 - Mihir Bellare, Phillip Rogaway:
Random Oracles are Practical: A Paradigm for Designing Efficient Protocols. 62-73 - Birgit Pfitzmann:
Sorting Out Signature Schemes. 74-85 - Patrick W. Brown:
Digital Signatures: Can They be Accepted as Legal Signatures in EDI? 86-92 - Don B. Johnson, Stephen M. Matyas, An V. Le, John D. Wilkins:
Design of the Commercial Data Masking Facility Data Privacy Algorithm. 93-96 - Paul F. Syverson:
Adding Time to a Logic of Authentication. 97-101 - Gennady Medvinsky, B. Clifford Neuman:
NetCash: A Design for Practical Electronic Currency on the Internet. 102-106 - Dan Brown:
Security Planning for Personal Communications. 107-111 - Thomas Y. C. Woo, Simon S. Lam:
A Framework for Distributed Authorization. 112-118 - Myong H. Kang, Ira S. Moskowitz:
A Pump for Rapid, Reliable, Secure Communication. 119-129 - Elisa Bertino, Pierangela Samarati, Sushil Jajodia:
Authorizations in Relational Database Management Systems. 130-139 - Elisa Bertino, Pierangela Samarati, Sushil Jajodia:
High Assurance Discretionary Access Control for Object Bases. 140-150 - Roger M. Needham:
Denial of Service. 151-153 - Calvin Ko, Deborah A. Frincke, Terrance Goan, Todd L. Heberlein, Karl N. Levitt, Biswanath Mukherjee, Christopher Wee:
Analysis of an Algorithm for Distributed Recognition and Accountability. 154-164 - Ping Lin, C. Sekar Chandersekaran:
Integration of DCE and Local Registries: Design Approaches. 165-170 - Jennifer Seberry, Xian-Mo Zhang, Yuliang Zheng:
Systematic Generation of Cryptographically Robust S-Boxes. 171-182 - Bart Preneel, René Govaerts, Joos Vandewalle:
Differential Cryptanalysis of Hash Functions Based on Block Ciphers. 183-188 - Thomas Beth, Hans-Joachim Knobloch, Marcus Otten:
Verifiable Secret Sharing for Monotone Access Structures. 189-194 - Hank M. Kluepfel:
Securing a Global Village and Its Resources: Baseline Security for Interconnected Signaling System #7 Telecommunications Networks. 195-212 - Gustavus J. Simmons:
Cryptanalysis and Protocol Failures (abstract). 213-214 - Ross J. Anderson:
Why Cryptosystems Fail. 215-227 - Yvo Desmedt, Mike Burmester:
Towards Practical "Proven Secure" Authenticated Key Distribution. 228-231 - Paul C. van Oorschot:
Extending Cryptographic Logics of Belief to Key Agreement Protocols. 232-243 - Steven M. Bellovin, Michael Merritt:
Augmented Encrypted Key Exchange: A Password-Based Protocol Secure against Dictionary Attacks and Password File Compromise. 244-250
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-07-11 00:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
