DOCSLIB.ORG

Design Principles and Patterns for Computer Systems That Are

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

Bibliography [AB04] Tom Anderson and David Brady. Principle of least astonishment. Ore- gon Pattern Repository, November 15 2004. http://c2.com/cgi/wiki? PrincipleOfLeastAstonishment. [Acc05] Access Data. Forensic toolkit—overview, 2005. http://www.accessdata. com/Product04_Overview.htm?ProductNum=04. [Adv87] Display ad 57, February 8 1987. [Age05] US Environmental Protection Agency. Wastes: The hazardous waste mani- fest system, 2005. http://www.epa.gov/epaoswer/hazwaste/gener/ manifest/. [AHR05a] Ben Adida, Susan Hohenberger, and Ronald L. Rivest. Fighting Phishing Attacks: A Lightweight Trust Architecture for Detecting Spoofed Emails (to appear), 2005. Available at http://theory.lcs.mit.edu/⇠rivest/ publications.html. [AHR05b] Ben Adida, Susan Hohenberger, and Ronald L. Rivest. Separable Identity- Based Ring Signatures: Theoretical Foundations For Fighting Phishing Attacks (to appear), 2005. Available at http://theory.lcs.mit.edu/⇠rivest/ publications.html. [AIS77] Christopher Alexander, Sara Ishikawa, and Murray Silverstein. A Pattern Lan- guage: towns, buildings, construction. Oxford University Press, 1977. (with Max Jacobson, Ingrid Fiksdahl-King and Shlomo Angel). [AKM+93] H. Alvestrand, S. Kille, R. Miles, M. Rose, and S. Thompson. RFC 1495: Map- ping between X.400 and RFC-822 message bodies, August 1993. Obsoleted by RFC2156 [Kil98]. Obsoletes RFC987, RFC1026, RFC1138, RFC1148, RFC1327 [Kil86, Kil87, Kil89, Kil90, HK92]. Status: PROPOSED STANDARD. [Ale79] Christopher Alexander. The Timeless Way of Building. Oxford University Press, 1979. 429 430 BIBLIOGRAPHY [Ale96] Christopher Alexander. Patterns in architecture [videorecording], October 8 1996. Recorded at OOPSLA 1996, San Jose, California. [Alt00] Steven Alter. Same words, different meanings: are basic IS/IT concepts our self-imposed Tower of Babel? Commun. AIS, 3(3es):2, 2000. [Alv97] Harald T. Alvestrand. X.400 frequenty asked questions, October 27 1997. http: //www.alvestrand.no/x400/faq-mhsnews.html. Cited on March 22, 2005. [Ame05] American Library Association Office for Information Technology Policy. Man- aging cookies to protect patron privacy, 2005. http://www.ala.org/ala/ washoff/oitp/emailtutorials/privacya/20.htm. Accessed April 20, 2005. [And98] M. Andrews. RFC 2308: Negative caching of DNS queries (DNS NCACHE), March 1998. Updates RFC1034, RFC1035 [Moc87b, Moc87c]. Status: PRO- POSED STANDARD. [App03] Appligent, Inc. Redax User Guide, Version 3.5. Appligent, 2003. http://www. appligent.com. [App04a] Apple Computer. Apple human interface guidelines, December 2004. http://developer.apple.com/documentation/UserExperience/ Conceptual/OSXHIGuidelines/OSXHIGuidelines.pdf. [App04b] Apple Computer. Apple human interface guidelines, March 2004. http://developer.apple.com/documentation/UserExperience/ Conceptual/OSXHIGuidelines/OSXHIGuidelines.pdf. [App04c] Apple Computer. Apple human interface guidelines, October 2004. http://developer.apple.com/documentation/UserExperience/ Conceptual/OSXHIGuidelines/OSXHIGuidelines.pdf. [App04d] Apple Computer. Apple software design guidelines, May 2004. http: //developer.apple.com/documentation/MacOSX/Conceptual/ AppleSWDesign/AppleSWDesign.pdf. [App04e] Apple Computer. Enabling secure storage with keychain services, June 2004. http://developer.apple.com/documentation/Security/ Conceptual/keychainServConcepts/keychainServConcepts.pdf. [App05] Apple. Apple – Mac OS X – security, 2005. http://www.apple.com/ macosx/features/security/. Cited on April 15, 2005. [Art02] Henrik Artman. Procurer usability requirements: negotiations in contract devel- opment. In NordiCHI ’02: Proceedings of the second Nordic conference on Human- computer interaction, pages 61–70. ACM Press, 2002. ISBN 1-58113-616-1. BIBLIOGRAPHY 431 [AS99] Anne Adams and Martina Angela Sasse. Users are not the enemy. Communica- tions of the ACM, 42:41–46, 1999. [Ass05] Association for India’s Development Austin. Computer drive, February 2005. http://studentorgs.utexas.edu/aidaustin/comp_drive.html. [ASZ96] D. Atkins, W. Stallings, and P. Zimmermann. RFC 1991: PGP message exchange formats, August 1996. Status: INFORMATIONAL. [Bal93] D. Balenson. RFC 1423: Privacy enhancement for Internet electronic mail: Part III: Algorithms, modes, and identifiers, February 1993. Obsoletes RFC1115. Sta- tus: PROPOSED STANDARD. [Bar91] John A. Barry. Technobabble. MIT Press, 1991. [Bax05] Ilse Baxter. Response to your questions, April 15 2005. [BBG00] Nicholas Bohm, Ian Brown, and Brian Gladman. Electronic commerce: Who carries the risk of fraud? Journal of Information Law & Technology, 2000. http: //www2.warwick.ac.uk/fac/soc/law/elj/jilt/2000_3/bohm/. [bBL02] Yung bin Benjamin Lee, August 2002. Personal Communication (via Gene Spaf- ford). [BC87] Kent Beck and Ward Cunningham. Using pattern languages for object-oriented programs. Technical Report CR-87-43, Apple Computer, Tektronix, September 1987. [BDSG04] Dirk Balfanz, Glenn Durfee, D. K. Smetters, and R. E. Grinter. In search of usable security: five lessons from the field. Security & Privacy Magazine, 2:19–24, Sept– Oct 2004. [BDSG05] Dirk Balfanz, Glenn Durfee, D. K. Smetters, and R. E. Grinter. Making the impos- sible easy: Usable PKI. In Lorrie Cranor and Simson Garfinkel, editors, Security and Usability. O’Reilly, 2005. To appear in August 2005. [Ber02] Scott Berinato. Good stuff cheap: A new hardware market is developing to give CIOs what they want most: good stuff cheap. This is its story. CIO, pages 53–59, 15 October 2002. [Ber05a] David Berlind. Thought to be redacted, classified military info exposed by cut n’ paste. ZDNet, May 1 2005. http://blogs.zdnet.com/BTL/?p=1329. [Ber05b] Jordy Berson. Creating usable security products for consumers. In Lorrie Cranor and Simson Garfinkel, editors, Security and Usability. O’Reilly, 2005. To appear in August 2005. [BF01] Dan Boneh and Matthew Franklin. Identity based encryption from the Weil pair- ing. Lecture Notes in Computer Science, 2139:213+, 2001. citeseer.ist. psu.edu/article/boneh01identitybased.html. 432 BIBLIOGRAPHY [BHm04] Bob Blakley, Craig Heath, and members of The Open Group Security Forum. Security design patterns. Technical Report G031, The Open Group, April 2004. http://www.opengroup.org/publications/catalog/g031.htm. [Bid96] C. Bradford Biddle. Misplaced priorities: The Utah Digital Signature Act and liability allocation in a public key infrastructure. San Diego Law Review, 33, 1996. [Bis96] Matt Bishop. Unix security: Threats and solutions, March 1996. http: //seclab.cs.ucdavis.edu/projects/vulnerabilities/scriv/ 1996-share86.pdf. Presentation to SHARE 86.0. [BL03] Ann Bostrom and Ragnar E. Lofstedt. Communicating risk: Wireless and hard- wired. Risk Analysis, 23(2):241–247, 2003. [Bla93] Matt Blaze. A cryptographic file system for Unix. In 1st ACM Conference on Com- munications and Computing Security, pages 9–16. ACM Press, November 1993. [BNN04a] Mihir Bellare, Chanathip Namprempre, and Gregory Neven. Security proofs for identity-based identification and signature schemes, 2004. http://eprint. iacr.org/2004/252.pdf. Updated version of [BNN04b]. [BNN04b] Mihir Bellare, Chanathip Namprempre, and Gregory Neven. Security proofs for identity-based identification and signature schemes. In C. Cachin and J. Ca- menisch, editors, Advances in Cryptology — Eurocrypt 2004, volume 3027 of Lecture notes in Computer Science, pages 268–286. 2004, 2004. [Bor96] Lorraine Borman. SIGCHI: the early years. SIGCHI Bull., 28(1):4–6, 1996. ISSN 0736-6906. http://doi.acm.org/10.1145/249170.249172. [BP01] Steven Bauer and Nissanka B. Priyantha. Secure data deletion for Linux file sys- tems. In Proc. 10th Usenix Security Symposium, pages 153–164. Usenix, San Antonio, Texas, 2001. http://www.usenix.org/events/sec01/full_ papers/bauer/bauer_html/. [Bra89a] R. Braden. STD 3: Requirements for Internet hosts — communication layers, October 1989. See also RFC1122, RFC1123 [Bra89b, Bra89c]. [Bra89b] R. T. Braden. RFC 1122: Requirements for Internet hosts — communication layers, October 1, 1989. See also STD0003 [Bra89a]. Status: STANDARD. [Bra89c] R. T. Braden. RFC 1123: Requirements for Internet hosts — application and sup- port, October 1, 1989. See also STD0003 [Bra89a]. Updates RFC0822 [Cro82a]. Updated by RFC2181 [EB97]. Status: STANDARD. [Bre00] Eric A. Brewer. Towards robust distributed systems (abstract). In PODC ’00: Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing, page 7. ACM Press, 2000. ISBN 1-58113-183-6. BIBLIOGRAPHY 433 [BS99] Ian Brown and C. R. Snow. A proxy approach to e-mail security. Softw. Pract. Exper., 29(12):1049–1060, 1999. ISSN 0038-0644. [BS03] Sacha Brostoff and M. Angela Sasse. Ten strikes and you’re out: Increasing the number of login attempts can improve password usability. In Workshop on Human-Computer Interaction and Security Systems, part of CHI2003. ACM Press, April 2003. citeseer.ist.psu.edu/618589.html. [BSD93] unlink, 1993. 4th Berkeley Distribution. [Bud02] Len Budney. Mailcrypt, September 2002. http://mailcrypt. sourceforge.net/. [Bus05] Business Environmental Resource Center. Hazardous waste generator fact sheet, 2005. http://sacberc.org/HazWaste.html. [Bye03] Simon Byers. Scalable exploitation of, and responses to information leakage through hidden data in published documents, April 3 2003. [CAG02] Lorrie Faith Cranor, Manjula Arjula, and Praveen Guduru. Use of a P3P user agent by early adopters. In WPES ’02: Proceedings of the 2002 ACM workshop on Privacy in the Electronic Society, pages 1–10. ACM Press, 2002.
Recommended publications
  • Mihir Bellare Curriculum Vitae Contents

    Mihir Bellare Curriculum Vitae Contents

    Mihir Bellare Curriculum vitae August 2018 Department of Computer Science & Engineering, Mail Code 0404 University of California at San Diego 9500 Gilman Drive, La Jolla, CA 92093-0404, USA. Phone: (858) 534-4544 ; E-mail: [email protected] Web Page: http://cseweb.ucsd.edu/~mihir Contents 1 Research areas 2 2 Education 2 3 Distinctions and Awards 2 4 Impact 3 5 Grants 4 6 Professional Activities 5 7 Industrial relations 5 8 Work Experience 5 9 Teaching 6 10 Publications 6 11 Mentoring 19 12 Personal Information 21 2 1 Research areas ∗ Cryptography and security: Provable security; authentication; key distribution; signatures; encryp- tion; protocols. ∗ Complexity theory: Interactive and probabilistically checkable proofs; approximability ; complexity of zero-knowledge; randomness in protocols and algorithms; computational learning theory. 2 Education ∗ Massachusetts Institute of Technology. Ph.D in Computer Science, September 1991. Thesis title: Randomness in Interactive Proofs. Thesis supervisor: Prof. S. Micali. ∗ Massachusetts Institute of Technology. Masters in Computer Science, September 1988. Thesis title: A Signature Scheme Based on Trapdoor Permutations. Thesis supervisor: Prof. S. Micali. ∗ California Institute of Technology. B.S. with honors, June 1986. Subject: Mathematics. GPA 4.0. Class rank 4 out of 227. Summer Undergraduate Research Fellow 1984 and 1985. ∗ Ecole Active Bilingue, Paris, France. Baccalauréat Série C, June 1981. 3 Distinctions and Awards ∗ PET (Privacy Enhancing Technologies) Award 2015 for publication [154]. ∗ Fellow of the ACM (Association for Computing Machinery), 2014. ∗ ACM Paris Kanellakis Theory and Practice Award 2009. ∗ RSA Conference Award in Mathematics, 2003. ∗ David and Lucille Packard Foundation Fellowship in Science and Engineering, 1996. (Twenty awarded annually in all of Science and Engineering.) ∗ Test of Time Award, ACM CCS 2011, given for [81] as best paper from ten years prior.
  • Design and Analysis of Secure Encryption Schemes

    Design and Analysis of Secure Encryption Schemes

    UNIVERSITY OF CALIFORNIA, SAN DIEGO Design and Analysis of Secure Encryption Schemes A dissertation submitted in partial satisfaction of the requirements for the degree Doctor of Philosophy in Computer Science by Michel Ferreira Abdalla Committee in charge: Professor Mihir Bellare, Chairperson Professor Yeshaiahu Fainman Professor Adriano Garsia Professor Mohan Paturi Professor Bennet Yee 2001 Copyright Michel Ferreira Abdalla, 2001 All rights reserved. The dissertation of Michel Ferreira Abdalla is approved, and it is acceptable in quality and form for publication on micro¯lm: Chair University of California, San Diego 2001 iii DEDICATION To my father (in memorian) iv TABLE OF CONTENTS Signature Page . iii Dedication . iv Table of Contents . v List of Figures . vii List of Tables . ix Acknowledgements . x Vita and Publications . xii Fields of Study . xiii Abstract . xiv I Introduction . 1 A. Encryption . 1 1. Background . 2 2. Perfect Privacy . 3 3. Modern cryptography . 4 4. Public-key Encryption . 5 5. Broadcast Encryption . 5 6. Provable Security . 6 7. Concrete Security . 7 B. Contributions . 8 II E±cient public-key encryption schemes . 11 A. Introduction . 12 B. De¯nitions . 17 1. Represented groups . 17 2. Message Authentication Codes . 17 3. Symmetric Encryption . 19 4. Asymmetric Encryption . 21 C. The Scheme DHIES . 23 D. Attributes and Advantages of DHIES . 24 1. Encrypting with Di±e-Hellman: The ElGamal Scheme . 25 2. De¯ciencies of ElGamal Encryption . 26 3. Overcoming De¯ciencies in ElGamal Encryption: DHIES . 29 E. Di±e-Hellman Assumptions . 31 F. Security against Chosen-Plaintext Attack . 38 v G. Security against Chosen-Ciphertext Attack . 41 H. ODH and SDH .
  • Compact E-Cash and Simulatable Vrfs Revisited

    Compact E-Cash and Simulatable Vrfs Revisited

    Compact E-Cash and Simulatable VRFs Revisited Mira Belenkiy1, Melissa Chase2, Markulf Kohlweiss3, and Anna Lysyanskaya4 1 Microsoft, [email protected] 2 Microsoft Research, [email protected] 3 KU Leuven, ESAT-COSIC / IBBT, [email protected] 4 Brown University, [email protected] Abstract. Efficient non-interactive zero-knowledge proofs are a powerful tool for solving many cryptographic problems. We apply the recent Groth-Sahai (GS) proof system for pairing product equations (Eurocrypt 2008) to two related cryptographic problems: compact e-cash (Eurocrypt 2005) and simulatable verifiable random functions (CRYPTO 2007). We present the first efficient compact e-cash scheme that does not rely on a ran- dom oracle. To this end we construct efficient GS proofs for signature possession, pseudo randomness and set membership. The GS proofs for pseudorandom functions give rise to a much cleaner and substantially faster construction of simulatable verifiable random functions (sVRF) under a weaker number theoretic assumption. We obtain the first efficient fully simulatable sVRF with a polynomial sized output domain (in the security parameter). 1 Introduction Since their invention [BFM88] non-interactive zero-knowledge proofs played an important role in ob- taining feasibility results for many interesting cryptographic primitives [BG90,GO92,Sah99], such as the first chosen ciphertext secure public key encryption scheme [BFM88,RS92,DDN91]. The inefficiency of these constructions often motivated independent practical instantiations that were arguably conceptually less elegant, but much more efficient ([CS98] for chosen ciphertext security). We revisit two important cryptographic results of pairing-based cryptography, compact e-cash [CHL05] and simulatable verifiable random functions [CL07], that have very elegant constructions based on non-interactive zero-knowledge proof systems, but less elegant practical instantiations.
  • Katalog Elektronskih Knjiga

    Katalog Elektronskih Knjiga

    KATALOG ELEKTRONSKIH KNJIGA Br Autor Naziv Godina ISBN Str. Porijeklo izdavanja 1 Peter Kent Pay Per Click Search 2006 0-471-74594-3 130 Kupovina Engine Marketing for Dummies 2 Terry Large Access 1 2007 Internet Freeware 3 Kevin Smith Excel Lassons & Tutorials 2004 Internet Freeware 4 Terry Michael Photografy Tutorials 2006 Internet Freeware Janine Peterson Phil Pivnick 5 Jake Ludington Converting Vinyl LPs 2003 Internet Freeware to CD 6 Allen Wyatt Cleaning Windows XP 2004 0-7645-7311-X Poklon for Dummies 7 Peter Kent Sarch Engine Optimization 2006 0-4717-5441-2 Kupovina for Dummies 8 Terry Large Access 2 2007 Internet Freeware 9 Dirk Dupon How to write, create, 2005 Internet Freeware promote and sell E-books on the Internet 10 Chayden Bates eBook Marketing 2000 Internet Freeware Explained 11 Kevin Sinclair How To Choose A 1999 Internet Freeware Homebased Bussines 12 Bob McElwain 101 Newbie-Frendly Tips 2001 Internet Freeware 13 Windows Basics 2004 Poklon 14 Michael Abrash Zen of Graphic 2005 Poklon Programming, 2. izdanje 15 13 Hot Internet 2000 Internet Freeware Moneymaking Methods 16 K. Williams The Complete HTML 1998 Poklon Teacher 17 C. Darwin On the Origin of Species Internet Freeware 2/175 Br Autor Naziv Godina ISBN Str. Porijeklo izdavanja 18 C. Darwin The Variation of Animals Internet Freeware 19 Bruce Eckel Thinking in C++, Vol 1 2000 Internet Freeware 20 Bruce Eckel Thinking in C++, Vol 2 2000 Internet Freeware 21 James Parton Captains of Industry 1890 399 Internet Freeware 22 Bruno R. Preiss Data Structures and 1998 Internet
  • Printed Program

    Printed Program

    rd International Conference 43 on Software Engineering goes Virtual PROGRAM May 25th –28th 2021 Co-located events: May 17th –May 24th Workshops: May 24th , May 29th –June 4th https://conf.researchr.org/home/icse-2021 @ICSEconf Table of Contents Conference overviews ............................................................... 3 Sponsors and Supporters ......................................................... 11 Welcome letter ........................................................................ 13 Keynotes ................................................................................. 18 Technical Briefings ................................................................. 28 Co-located events .................................................................... 35 Workshops .............................................................................. 36 New Faculty Symposium ........................................................ 37 Doctoral Symposium .............................................................. 39 Detailed Program - Tuesday, May 25th .................................................... 42 - Wednesday, May 26th ............................................... 53 - Thursday, May 27th .................................................. 66 - Friday, May 28th ....................................................... 80 Awards .................................................................................... 91 Social and Networking events ................................................. 94 Organizing Committee ........................................................
  • ESSAY Untangling Attribution David D. Clark* and Susan Landau**

    ESSAY Untangling Attribution David D. Clark* and Susan Landau**

    ESSAY Untangling Attribution David D. Clark* and Susan Landau** I. Introduction In February 2010, former Director of the National Security Agency Mike McConnell wrote, "We need to develop an early-warning system to monitor cyberspace, identify intrusions and locate the source of attacks with a trail of evidence that can support diplomatic, military and legal options and we must be able to do this in milliseconds. More specifically, we need to reengineer the Internet to make attribution, geolocation, intelligence analysis and impact assessment - who did it, from where, why and what was the result - more manageable."I The Internet was not designed with the goal of deterrence in mind, and perhaps a future Internet should be designed differently. McConnell's statement is part of a recurring theme that a secure Internet must provide better attribution for actions occurring on the network. Although attribution generally means assigning a cause to an action, as used here attribution refers to identifying the agent responsible for the action (specifically, "determining * David Clark, Senior Research Scientist, MIT, Cambridge MA 02139, ddc acsail.mit.edu. Clark's effort on this work was funded by the Office of Naval Research under award number N00014-08-1-0898. Any opinions, findings, and conclusions or recommendations expressed in this Essay are those of the authors and do not necessarily reflect the views of the Office of Naval Research. " Susan Landau, Fellow, Radcliffe Institute for Advanced Study, Harvard University, Cambridge, MA 02138, susan.landau(a) rivacvink.oru. An earlier version of this Essay appeared in COMMI. ON DLTLRRING CYBERATTACKS, NAT'L RLSLARCH COUNCIL, PROCELDINGS OF A WORKSHOP ON DLTLRRING CYBLRATTACKS: INFORMING STRATEGILS AND DLVLLOPING OPTIONS FOR U.S.
  • A Dataset of Open-Source Safety-Critical Software⋆

    A Dataset of Open-Source Safety-Critical Software⋆

    A Dataset of Open-Source Safety-Critical Software? Rafaila Galanopoulou[0000−0002−5318−9017] and Diomidis Spinellis[0000−0003−4231−1897] Department of Management Science and Technology Athens University of Economics and Business Patission 76, Athens, 10434, Greece ft8160018,[email protected] https://www.aueb.gr Abstract. We describe the method used to create a dataset of open- source safety-critical software, such as that used for autonomous cars, healthcare, and autonomous aviation, through a systematic and rigorous selection process. The dataset can be used for empirical studies regard- ing the quality assessment of safety-critical software, its dependencies, and its development process, as well as comparative studies considering software from other domains. Keywords: open-source · safety-critical · dataset 1 Introduction Safety-critical systems (SCS) are those whose failure could result in loss of life, significant property damage, or damage to the environment [5]. Over the past decades ever more software is developed and released as open-source software (OSS) | with licenses that allow its free use, study, change, and distribution [1]. The increasing adoption of open-source software in safety-critical systems [10], such as those used in the medical, aerospace, and automotive industries, poses an interesting challenge. On the one hand, it shortens time to delivery and lowers development costs [6]. On the other hand, it introduces questions regarding the system's quality. For a piece of software to be part of a safety-critical application it requires quality assurance, because quality is a crucial factor of an SCS's software [3]. This assurance demands that evidence regarding OSS quality is supplied, and an analysis is needed to assess if the certification cost is worthwhile.
  • Pgpfone Pretty Good Privacy Phone Owner’S Manual Version 1.0 Beta 7 -- 8 July 1996

    Pgpfone Pretty Good Privacy Phone Owner’S Manual Version 1.0 Beta 7 -- 8 July 1996

    Phil’s Pretty Good Software Presents... PGPfone Pretty Good Privacy Phone Owner’s Manual Version 1.0 beta 7 -- 8 July 1996 Philip R. Zimmermann PGPfone Owner’s Manual PGPfone Owner’s Manual is written by Philip R. Zimmermann, and is (c) Copyright 1995-1996 Pretty Good Privacy Inc. All rights reserved. Pretty Good Privacy™, PGP®, Pretty Good Privacy Phone™, and PGPfone™ are all trademarks of Pretty Good Privacy Inc. Export of this software may be restricted by the U.S. government. PGPfone software is (c) Copyright 1995-1996 Pretty Good Privacy Inc. All rights reserved. Phil’s Pretty Good engineering team: PGPfone for the Apple Macintosh and Windows written mainly by Will Price. Phil Zimmermann: Overall application design, cryptographic and key management protocols, call setup negotiation, and, of course, the manual. Will Price: Overall application design. He persuaded the rest of the team to abandon the original DOS command-line approach and designed a multithreaded event-driven GUI architecture. Also greatly improved call setup protocols. Chris Hall: Did early work on call setup protocols and cryptographic and key management protocols, and did the first port to Windows. Colin Plumb: Cryptographic and key management protocols, call setup negotiation, and the fast multiprecision integer math package. Jeff Sorensen: Speech compression. Will Kinney: Optimization of GSM speech compression code. Kelly MacInnis: Early debugging of the Win95 version. Patrick Juola: Computational linguistic research for biometric word list. -2- PGPfone Owner’s
  • Windows 95 & NT

    Windows 95 & NT

    Windows 95 & NT Configuration Help By Marc Goetschalckx Version 1.48, September 19, 1999 Copyright 1995-1999 Marc Goetschalckx. All rights reserved Version 1.48, September 19, 1999 Marc Goetschalckx 4031 Bradbury Drive Marietta, GA 30062-6165 tel. (770) 565-3370 fax. (770) 578-6148 Contents Chapter 1. System Files 1 MSDOS.SYS..............................................................................................................................1 WIN.COM..................................................................................................................................2 Chapter 2. Windows Installation 5 Setup (Windows 95 only)...........................................................................................................5 Internet Services Manager (Windows NT Only)........................................................................6 Dial-Up Networking and Scripting Tool....................................................................................6 Direct Cable Connection ..........................................................................................................16 Fax............................................................................................................................................17 Using Device Drivers of Previous Versions.............................................................................18 Identifying Windows Versions.................................................................................................18 User Manager (NT Only) .........................................................................................................19
  • Transferable Constant-Size Fair E-Cash

    Transferable Constant-Size Fair E-Cash

    Transferable Constant-Size Fair E-Cash Georg Fuchsbauer, David Pointcheval, and Damien Vergnaud Ecole´ normale sup´erieure,LIENS - CNRS - INRIA, Paris, France http://www.di.ens.fr/f~fuchsbau,~pointche,~vergnaudg Abstract. We propose an efficient blind certification protocol with interesting properties. It falls in the Groth-Sahai framework for witness-indistinguishable proofs, thus extended to a certified signature it immediately yields non-frameable group signatures. We use blind certification to build an efficient (offline) e-cash system that guarantees user anonymity and transferability of coins without increasing their size. As required for fair e-cash, in case of fraud, anonymity can be revoked by an authority, which is also crucial to deter from double spending. 1 Introduction 1.1 Motivation The issue of anonymity in electronic transactions was introduced for e-cash and e-mail in the early 1980's by Chaum, with the famous primitive of blind signatures [Cha83,Cha84]: a signer accepts to sign a message, without knowing the message itself, and without being able to later link a message- signature pair to the transaction it originated from. In e-cash systems, the message is a serial number to make a coin unique. The main security property is resistance to \one-more forgeries" [PS00], which guarantees the signer that after t transactions a user cannot have more than t valid signatures. Blind signatures have thereafter been widely used for many variants of e-cash systems; in particular fair blind signatures [SPC95], which allow to provide revocable anonymity. They deter from abuse since in such a case the signer can ask an authority to reveal the identity of the defrauder.
  • Digital Forensics and Preservation 1

    Digital Forensics and Preservation 1

    01000100 01010000 Digital 01000011 Forensics 01000100 and Preservation 01010000 Jeremy Leighton John 01000011 01000100 DPC Technology Watch Report 12-03 November 2012 01010000 01000011 01000100 01010000 Series editors on behalf of the DPC 01000011 Charles Beagrie Ltd. Principal Investigator for the Series 01000100 Neil Beagrie 01010000 01000011DPC Technology Watch Series © Digital Preservation Coalition 2012 and Jeremy Leighton John 2012 Published in association with Charles Beagrie Ltd. ISSN: 2048-7916 DOI: http://dx.doi.org/10.7207/twr12-03 All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted, in any form or by any means, without the prior permission in writing from the publisher. The moral right of the author has been asserted. First published in Great Britain in 2012 by the Digital Preservation Coalition. Foreword The Digital Preservation Coalition (DPC) is an advocate and catalyst for digital preservation, ensuring our members can deliver resilient long-term access to digital content and services. It is a not-for- profit membership organization whose primary objective is to raise awareness of the importance of the preservation of digital material and the attendant strategic, cultural and technological issues. It supports its members through knowledge exchange, capacity building, assurance, advocacy and partnership. The DPC’s vision is to make our digital memory accessible tomorrow. The DPC Technology Watch Reports identify, delineate, monitor and address topics that have a major bearing on ensuring our collected digital memory will be available tomorrow. They provide an advanced introduction in order to support those charged with ensuring a robust digital memory, and they are of general interest to a wide and international audience with interests in computing, information management, collections management and technology.
  • Cybersecurity Tips, Tools, and Techniques

    Cybersecurity Tips, Tools, and Techniques

    Cybersecurity Tips, Tools and Techniques for Your Professional Tool Bag Ron Woerner, CISSP, CISM Bellevue University @ronw123 10/23/2019 Ron Woerner WhoAmI – Ron Woerner • President / Chief Trusted Advisor • Cybersecurity Instructor, Bellevue University • 25+ years experience in IT / Security • CISSP, CISM • Blogger, podcaster & writer • Given tons’o presentations on security and Internet safety 10/23/2019 Ron Woerner Thoughts are my own Use at your own risk 10/23/2019 Ron Woerner Apologies in advance for broken links Content as of October 2019 10/23/2019 Ron Woerner What the $%$# are we doing here? Tools, applications, Cybersecurity tips to keep websites, references, yourself, others, and other stuff that can help hopefully your company you do you job. out of trouble. 10/23/2019 Ron Woerner First Some Basics 10/23/2019 Ron Woerner If you only remember 1 slide… https://niccs.us-cert.gov/national-cybersecurity-awareness-month-2019 https://staysafeonline.org/ https://www.stopthinkconnect.org/ 10/23/2019 Ron Woerner #1 Overall Tool - Humans “The art and science of skillfully maneuvering humans to take an action that may or may not be in their own best interests.” Chris Hadnagy, Social Engineering, The Science of Human Hacking 10/23/2019 Ron Woerner #1 Technical Hacking Tool https://www.google.com/advanced_search 10/23/2019 Ron Woerner Time Travel Google Cache Archive.org – Wayback Machine 10/23/2019 Ron Woerner Lists of tools, tips, & tricks • SecTools • Peerlyst List of Security Tools • OlderGeeks • HowToGeek.com, Geek School 10/23/2019