This directory is created automatically and some papers may be mislabeled. Only document within the CiteSeer database are listed. The directory is intended to provide entry points for browsing the database and is not intended to be authoritative. Papers may not appear in all relevant categories. For example, papers in a sub-category may not appear in higher level categories.
9883.2 Lecture Notes on Cryptography - Goldwasser, Bellare (1996)(Correct)
Contents
1 Introduction to Modern Cryptography 12
1.1 Encryption: Historical Glance : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 12
1.2 Modern Encryption: A Computational C... / to Modern Cryptography . Encryption Historical Glance br . Modern Encryption A Computational Complexity
8740.2 Cryptology - Rivest (1990)(Correct)
Cryptology has advanced tremendously since 1976; this chapter provides a brief overview of the
current state-of-the-art in the field. Several major themes predominate in the development. One
such them... / The One-Time Pad . The Data Encryption Standard DES . The Goals and br . Deterministic Public-Key Encryption . . RSA . . Knapsacks .
8421.9 Complexity and Security of Distributed Protocols - Franklin (1993)(Correct)
This thesis addresses the topic of secure distributed computation, a general and powerful tool
for balancing cooperation and mistrust among independent agents. We study many related models,
which diff... / Games . Joint Encryption and Message-Efficient Secure br of a new group-oriented encryption scheme based on concrete
7042.9 The Foundations of Modern Cryptography - Goldreich (1998)(Correct)
In our opinion, the Foundations of Cryptography are the paradigms, approaches and techniques
used to conceptualize, define and provide solutions to natural cryptographic problems.
In this essay, we ... / II Basic Utilities Encryption . Definitions br provided a definition of secure encryption The reader may be
6385.0 Block Ciphers - Robshaw (1995)(Correct)
This technical report provides a review of the design and analysis of block
ciphers. Its format is built around the twin ideas of design and cryptanalysis
and with this in mind we present some of the ... / Multiple encryption Conclusions . br the literature that the Data Encryption Standard DES has been
6139.9 Aspects Of Group Communications Security - Hassler (1995)(Correct)
this
document ISO defines the following basic security services (compare Sec.4.4.2): unknown ASPECTS OF GROUP
COMMUNICATIONS SECURITY
DISSERTATION
Vesna Hassler
Institut fur Angewandte Informationsver... / . RSA encryption br . ElGamal encryption
5623.9 Varieties of Secure Distributed Computing - Franklin, Yung (1996)(Correct)
this paper, we will see solutions to the Fortune 500 problem (or any other computational
problem) that assume nothing more than that each company trusts that there are at least 333
other companies tha... / functions trapdoor functions encryption bit commitment interactive and br to define probabilistic encryption bit commitment and
5421.4 Stream Ciphers - Robshaw (1995)(Correct)
this technical report we provide a review of current stream cipher
techniques. Anyone looking through the cryptographic literature will be
struck by a great difference in the treatment of block cipher... / that they use for both encryption and decryption. This br to stream ciphers to provide the encryption speeds they need. This report
5368.9 Using Secure Coprocessors - Yee (1994)(Correct)
How do we build distributed systems that are secure? Cryptographic techniques can be used to secure the communications between physically separated systems, but this is not enough: we must be able to ... / requires end-to-end encryption. As a result of the need for br As a result of the need for encryption and authentication our systems
5272.8 Twofish: A 128-Bit Block Cipher - Schneier, Kelsey, Whiting, Wagner.. (1998)(Correct)
Twofish is a 128-bit block cipher that accepts a variable-length key up to 256 bits. The cipher is a
16-round Feistel network with a bijective F function made up of four key-dependent 8-by-8-bit S-bo... / . A. Full Encryptions . br the first public request for an encryption standard. The result was DES
4881.6 Formal Methods for the Analysis of Authentication Protocols - Rubin, Honeyman (1993)(Correct)
In this paper, we examine current approaches and
the state of the art in the application of formal methods
to the analysis of authentication protocols. We
use Meadows' classification of analysis techn... / system is typically used as an encryption key. The encryption scheme has br used as an encryption key. The encryption scheme has the property that a
4585.7 An Overview of Secure Distributed Computing - Franklin, Galil, Yung (1992)(Correct)
Secure distributed computing protocols allow a group of players, within some specific computational
environment, to evaluate jointly the output of a function while maintaining the secrecy
of privately... / functions trapdoor functions encryption bit commitment interactive and br to define probabilistic encryption bit commitment and
4237.7 A Proxy Based Filtering Mechanism for the Mobile Environment - Zenel (1998)(Correct)
A Proxy Based Filtering Mechanism for the Mobile
Environment
Bruce Zenel
Host mobility complicates the standard networking model in unexpected ways. It
increases network heterogeneity, causing diff... / . . End to End Encryption . br of authentication and encryption to increase the level of
4196.1 A Combined Network, System and User Based Approach to Improving the.. - Kouvelas (1998)(Correct)
In real-time interactive Internet multimedia conferencing, audio quality can be impaired
by packet loss resulting from network congestion, lack of real-time process support in
end-host operating syste... / . . . Audio Stream Encryption . br the RAT transcoder and added encryption modules. Markus Iken has
4079.4 Recent Developments in the Design of Conventional Cryptographic.. - Preneel, Rijmen, Bosselaers (1998)(Correct)
This paper examines proposals for three cryptographic primitives: block ciphers, stream ciphers, and hash functions. It provides an overview of the design principles of a large number of recent propos... / tool that can be used for encryption the properties of the br encryption the properties of the encryption depend on the mode ECB CBC
4055.5 Lattice Reduction in Cryptology: An Update - Nguyen, Stern (2000)(Correct)
Lattices are regular arrangements of points in space, whose
study appeared in the 19th century in both number theory and crystallography.
The goal of lattice reduction is to find useful representa... / some of those schemes offered encryption decryption rates asymptotically br and can attain very high encryption decryption rates. But basically
3924.6 The Design, Implementation, And Evaluation Of Cryptographic.. - Venugopal (1996)(Correct)
This research investigates techniques for providing privacy, authentication, and data
integrity to message passing in distributed applications. Various software mechanisms for
message hashing and encr... / for message hashing and encryption are evaluated including br MD and various symmetric encryption algorithms to provide message
3813.7 A Quick Glance at Quantum Cryptography - Lomonaco, Jr. (1998)(Correct)
The recent application of the principles of quantum mechanics to
cryptography has led to a remarkable new dimension in secret communication.
As a result of these new developments, it is now possible t... / perfectly secure. However if the encryption method and key K are wisely br capability and means. The Data Encryption Standard DES is believed to
3794.3 Customization and Composition of Distributed Objects: Policy.. - Astley (1999)(Correct)
Research in software architecture has emphasized compositional development, where the computational
aspects of a system are modularly separated from communication and coordination
aspects. Typically, ... / . Meta-Level Implementation of Encryption The Encrypt meta-actor br . . Encryption Policy The Encryption policy
3667.4 Normal Bases over Finite Fields - Gao (1993)(Correct)
Interest in normal bases over finite fields stems both from mathematical theory and practical
applications. There has been a lot of literature dealing with various properties of normal bases
(for fini... / and F and an encryption processor for F br T. Rosati A high speed data encryption processor for public key
3632.4 Answers To Frequently Asked Questions About Today's Cryptography - Fahn (1993)(Correct)
this document, authentication will generally refer to the use of digital
signatures, which play a function for digital documents similar to that played by
handwritten signatures for printed documents:... / General . What is encryption br . How is RSA used for encryption in practice
3612.4 Fast Generation of Prime Numbers and Secure Public-Key Cryptographic.. - Maurer (1994)(Correct)
A very efficient recursive algorithm for generating nearly random provable primes is presented. The expected time for generating a prime is only slightly greater than the expected time required for ge... / detailed analysis of the iterated encryption attack on the RSA public-key br detailed analysis of the iterated-encryption attack against the RSA
3538.1 Distributed Software Engineering - Invited State-of-the-Art Report - Kramer(Correct)
The term "Distributed Software Engineering" is
ambiguous
1
. It includes both the engineering of
distributed software and the process of distributed
development of software, such as cooperative work... / services authentication and encryption synchronisation services for
3513.9 Transport System Architectures for High-Performance Communications.. - Schmidt, Suda (1993)(Correct)
Providing end-to-end gigabit communication support for
bandwidth-intensive distributed applications requires highperformance
transport systems. This paper describes and
classifies transport system mec... / error detection retransmission encryption and compression schemes. Both br presentation services e.g.encryption compression and network
3485.3 Cryptographic Algorithms: Properties, Design And Analysis - Pieprzyk (1996)(Correct)
The paper presents an overview of recent developments in the design of cryptographic
algorithms. A short historical introduction sheds a ray of light on some events which contributed
to the advancemen... / educated opponents who knew the encryption process but did not know the br it was requested that encryption and decryption processes could
3464.9 Non-Malleable Cryptography - Dolev, Dwork, Naor (1998)(Correct)
The notion of non-malleable cryptography, an extension of semantically secure cryptography,
is defined. Informally, in the context of encryption the additional requirement is that given
the ciphertext... / Informally in the context of encryption the additional requirement is br Informally in the context of encryption the additional requirement is
3454.3 SLIC: An Extensibility System for Commodity Operating Systems - Ghormley, Rodrigues, Petrou, Anderson (1998)(Correct)
Modern commodity operating systems are large and complex systems
developed over many years by large teams of programmers,
containing many hundreds of thousands of lines of code. Consequently,
it is ex... / in a CERT advisory a simple encryption file system and a restricted br for a recent CERT advisory an encryption file system and a restricted
3414.7 Cryptographic Hash Functions: A Survey - Bakhtiari, Safavi-Naini, Pieprzyk (1995)(Correct)
This paper gives a survey on cryptographic hash functions. It gives an overview of all types of hash functions and reviews design principals and possible methods of attacks. It also focuses on keyed h... / the secret key of the sender. Encryption may be either by using a public br key or a private key algorithm. Encryption of the digest prevents active
3401.6 Security Protocols and their Properties - Abadi (2000)(Correct)
Specifications for security protocols range from informal narrations of message flows to formal assertions of protocol properties. This paper discusses those specifications, emphasizing authenticity a... / and the other is used for encryptions and for signature br The braces represent the encryption operation in this case using a
3348.6 Invertible Cellular Automata: A Review - Toffoli, Margolus (1990)(Correct)
this paper. Our involvement with ica represents the convergence of several research trails, including unknown Reprinted with corrections and
annotations (as of Dec. 1996) from
Physica D (1990), 229--... / cellular automata. ffl Data encryption. . An apology We have
3266.2 Iterative Decoding Of Turbo Codes And Other Concatenated Codes - Barbulescu (1996)(Correct)
CONTENTS
Table of Contents i . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
List of Figures iv . . . . . . . . . . . . . . . . . . . ... / . . Interleaver design for encryption purposes . br we want to transmit an encryption scheme might be used. The data
3262.4 Dyad: A System for Using Physically Secure Coprocessors - Tygar, Yee (1991)(Correct)
The Dyad project at Carnegie Mellon University is using physically secure
coprocessors to achieve new protocols and systems addressing a number of
perplexing security problems. These coprocessors can ... / for use with end-toend encryption to provide privacy on network br to log keystrokes to extract encryption keys Even greater
3261.6 Security and Decentralized Control in the SFS Global File System - Mazières (1997)(Correct)
SFS (secure file system) is a global file system designed to be secure against all active and passive network attacks, provide a single namespace across all machines in the world, and avoid any form o... / show that despite its use of encryption and user-level servers SFS br overlaps the cost of encryption with network latency and lets
3203.3 Number-Theoretic Constructions of Efficient Pseudo-Random Functions - Naor, Reingold (1997)(Correct)
We describe efficient constructions for various cryptographic primitives (both in privatekey
and in public-key cryptography). We show these constructions to be at least as secure as
the decisional ver... / the public key g a the encryption of a message m is hg b br in order to get a probabilistic encryption-scheme whose semantic security
3169.9 Cryptanalysis Of RSA-Type Cryptosystems: A Visit - Joye, Quisquater (1998)(Correct)
This paper surveys RSA-type implementations based on Lucas sequences
and on elliptic curves. The main focus is the way how some known attacks on RSA were
extended to LUC, KMOV and Demytko's system. ... / of the protocol in use for encryption or signature . attacks br pq. Next he chooses a public encryption key e that is relatively prime
3090.9 Security Protocols and Specifications - Abadi (1999)(Correct)
Specifications for security protocols range from informal narrations of message flows to formal assertions of protocol properties. This paper (intended to accompany a lecture at ETAPS '99) discusses t... / The braces represent the encryption operation in this case using a br for computing C S concern encryption and decryption if M
3051.3 Synthesizers and Their Application to the Parallel Construction of.. - Naor, Reingold (1995)(Correct)
A pseudo-random function is a fundamental cryptographic primitive that is essential for encryption,
identification and authentication. We present a new cryptographic primitive called pseudorandom
synt... / primitive that is essential for encryption identification and br Such an application is the encryption of messages on a network where
3040.3 Discrete logarithms: The past and the future - Odlyzko (1999)(Correct)
The first practical public key cryptosystem to be published, the Diffie-Hellman key exchange algorithm, was based on the assumption that discrete logarithms are hard to compute. This intractability hy... / it is harder to use it for encryption than if it were based on RSA br control regulations on strong encryption without weakening the digital
2997.3 Issues in the Incorporation of Security Services into a Protocol.. - Tripunitara, Spafford(Correct)
A Protocol Reference Model is an abstraction of the communication subsystem of a system. Thus,
it is appropriate to focus on the protocol reference model when examining the issue of secure communicati... / the integrity service the Data Encryption Standard which could be br encipherment using the Data Encryption Standard DES can be
2934.2 Byzantine Quorum Systems - Malkhi, Reiter (1997)(Correct)
Quorum systems are well-known tools for ensuring the consistency and availability of replicated
data despite the benign failure of data repositories. In this paper we consider the arbitrary
(Byzantine... / data self-verifying via encryption and consequently the quorum
2857.6 Secure Coprocessors in Electronic Commerce Applications - Yee, Tygar (1995)(Correct)
Many researchers believe electronic wallets (secure storage devices that maintain account balances) are the solution to electronic commerce challenges. This paper argues for a more powerful model --- ... / memory for example high speed encryption decryptionhardware may be used. br example it is often assumed that encryption systems are resistant to
2800.2 Interposition as an Operating System Extension Mechanism - Ghormley, Rodrigues, Petrou, Anderson (1997)(Correct)
Modern production operating systems are large and complex systems
developed over many years by large teams of programmers,
containing many hundreds of thousands of lines of code. Consequently,
it is e... / in a CERT advisory a simple encryption file system and a restricted br to a recent CERT advisory an encryption file system and a restricted
2794.0 IP Multicast Security: Issues and Directions - Hardjono, Tsudik (1999)(Correct)
Security represents one of the major obstacles today to the wider deployment of IP multicast.
The current work identifies and discusses the various concepts and issues underlying
multicast security.... / subscribers. In this example encryption of the data may be used to br and are confidential in nature encryption must be used to achieved the
2785.6 Program Verification - Boyer, Moore (1985)(Correct)
this article:
inductive invariants, functional semantics, and explicit semantics. Because the first approach has
received by far the most attention, it has produced the most impressive results to date... / Shamir and Adleman public key encryption algorithm the soundness br Checking the RSA Public Key Encryption Algorithm American
2774.4 On the Construction of Pseudo-Random Permutations: Luby-Rackoff.. - Naor, Reingold (1997)(Correct)
Luby and Rackoff [27] showed a method for constructing a pseudo-random permutation from
a pseudo-random function. The method is based on composing four (or three for weakened security)
so called Feist... / Block ciphers are private-key encryption schemes such that the br encryption schemes such that the encryption of every plaintext-block is a
2773.7 Random Oracles are Practical: A Paradigm for Designing Efficient.. - Bellare, Rogaway (1995)(Correct)
We argue that the random oracle model ---where all parties have access to a public random oracle--- provides a bridge between cryptographic theory and cryptographic practice. In the paradigm we sugges... / gains for problems including encryption signatures and zero-knowledge br oracle setting. Efficient Encryption. Goals which are possible but
2751.9 Security Problems in the TCP/IP Protocol Suite - Bellovin (1989)(Correct)
The TCP/IP protocol suite, which is very widely used today, was developed
under the sponsorship of the Department of Defense. Despite that, there are a
number of serious security flaws inherent in the... / broad-spectrum defenses such as encryption. . INTRODUCTION The br ISN S generation. The Data Encryption Standard DES in
2686.5 The Multimedia Internet Terminal (MInT) - Sisalem, Schulzrinne(Correct)
The Multimedia Internet Terminal (MINT)
1
is a flexible multimedia tool set that
allows the establishment and control of multimedia sessions across the Internet. The
system architecture is fully dis... / payload type marking encryption and demarcation of application br conferences have to rely on encryption to ensure privacy. Due to packet
2644.6 Efficient Cryptographic Schemes Provably as Secure as Subset Sum - Impagliazzo, Naor (1996)(Correct)
We show very efficient constructions for a pseudo-random generator and for a universal
one-way hash function based on the intractability of the subset sum problem for certain
dimensions. (Pseudo-rando... / can be used for private key encryption and universal one-way hash br as the basis for public key encryption. However none of these schemes
2637.9 Distributed Pseudo-Random Functions and KDCs - Naor, Pinkas, Reingold (1999)(Correct)
This work describes schemes for distributing between n servers
the evaluation of a function f which is an approximation to a random
function, such that only authorized subsets of servers are able to... / in Section . . ii Long-tem encryption of information where a user br used as a key for a private-key encryption scheme The parameter can
2628.9 Robust Efficient Distributed RSA-Key Generation - Frankel, MacKenzie, Yung(Correct)
We solve a central open problem in distributed cryptography, that of robust efficient distributed generation of RSA keys. An efficient protocol is one which is independent of the primality test "circu... / such as composite ElGamal encryption signature identification br semantically-secure public-key encryption for sending private messages
2619.6 A Reduction for Automated Verification of Authentication Protocols - Stoller (1999)(Correct)
Authentication protocols (including protocols that provide key establishment) are designed
to work correctly in the presence of an adversary that can prompt honest principals to engage in
an unbounded... / or keys and Key is a set of encryption keys defined by Key Key br be unencrypted in a term. The encryption height of a ground term t is
2601.0 Formal Verification of Cryptographic Protocols: A Survey - Meadows (1995)(Correct)
In this paper we give a survey of the state of the art in the application of formal methods to the analysis of cryptographic protocols. We attempt to outline some of the major threads of research in t... / perform any operation such as encryption that is available to legitimate br is to be kept secret such as encryption keys belonging to honest users
2598.8 Justifying Finite Resources for Adversaries in Automated Analysis of.. - Stoller (1999)(Correct)
Authentication protocols (including protocols that provide key establishment) are designed
to work correctly in the presence of an adversary that can (1) perform an unbounded
number of encryptions (an... / perform an unbounded number of encryptions and other operations while br bound on the worst-case number of encryptions by the adversary and an
2577.3 An experience teaching a graduate course in cryptography - Rubin(Correct)
We describe an experience of teaching "Cryptography and Computer Security" in the fall of 1995
at New York University. The class was intended as an introduction for graduate students interested
in exp... / first system taught was the Data Encryption Standard DES The br the commutative property of RSA encryption. However by observing which
2574.3 Lower and Upper Bounds for Attacks on Authentication Protocols - Stoller (1998)(Correct)
Authentication protocols (including protocols that provide key establishment) are designed to work correctly in the presence of an adversary that can (1) perform an unbounded number of encryptions (an... / perform an unbounded number of encryptions and other operations while br bound on the worst-case number of encryptions by the adversary and an
2532.2 Shortened Digital Signature, Signcryption and Compact and Unforgeable .. - Zheng (1998)(Correct)
geable key agreement
schemes/protocols are presented. All these protocols are based on the signcryption
schemes.
The shortened signature, signcryption and key agreement schemes can all be extended
to... / digital signature and public key encryption in a single step and with a br by signature followed by encryption ffl Finally in Part III a
2528.3 New Efficient and Secure Protocols for Verifiable Signature Sharing.. - Catalano, Gennaro (1998)(Correct)
Verifiable Signature Sharing (V\SigmaS ) was introduced by Franklin and Reiter in [20]. V\SigmaS
enables the recipient of a digital signature, who is not necessarily the original signer,
to share suc... / construct binding RSA public key encryptions. Details about these br S where E is a public key encryption scheme and the decryption key
2515.4 Discrete logarithms in finite fields and their cryptographic.. - Odlyzko (1984)(Correct)
Given a primitive element g of a finite field GF(q), the discrete logarithm of a nonzero element
u GF(q) is that integer k, 1 k q - 1, for which u = g
k
. The well-known problem of computing
dis... / communicate using some standard encryption method such as DES but who do br cryptanalysis of the NBS Data Encryption Standard Computer
2513.7 Using DNA to solve the Bounded Post Correspondence Problem - Kari, Gloor, Yu(Correct)
Introduction
Molecular computing, known also under the name of biomolecular computing,
biocomputing or DNA computing, is a new computation paradigm that
employs (bio)molecule manipulation to solve co... / Problem breaking the Data Encryption Standard expansions of
2509.8 A Calculus for Cryptographic Protocols - The Spi Calculus - Abadi, Gordon (1998)(Correct)
We introduce the spi calculus, an extension of the pi calculus designed for describing and analyzing cryptographic protocols. We show how to use the spi calculus, particularly for studying authenticat... / . . Public-Key Encryption and Digital Signatures . br Appendices A Encoding Encryption in the Pi Calculus B Proofs
2497.0 A Key Recovery Attack on Discrete Log-based Schemes Using a Prime.. - Lim, Lee (1997)(Correct)
Consider the well-known oracle attack: somehow one gets a
certain computation result as a function of a secret key from the secret
key owner and tries to extract some information on the secret key. ... / and some applications of ElGamal encryption and signature schemes. br shared decryption of ElGamal encryption shared verification of ElGamal
2489.7 Signaling for Internet Telephony - Schulzrinne, Rosenberg (1998)(Correct)
Internet telephony must offer the standard telephony services. However, the transition to Internetbased
telephony services also provides an opportunity to create new services more rapidly and with
low... / Access control is through encryption. This session model is often
2488.8 On Provable Security for Digital Signature Algorithms - Pointcheval, Vaudenay (1996)(Correct)
In this paper we consider provable security for ElGamal-like digital
signature schemes. We point out that the good security criterion on the
underlying hash function is pseudorandomness. We extend Poi... / has already been considered for encryption functions. Actually Luby and br was to argue that the US Data Encryption Standard was strong. Later
2483.0 Sparse RSA Secret Keys and Their Generation - Lim, Lee (1996)(Correct)
In this paper we consider the problem of reducing the computational load by use of
restricted key parameters in the RSA system. We present various methods for generating
RSA key parameters that can pr... / When the RSA system is used in encryption mode for example to transmit a br algorithm can be used for both encryption and decryption. For this it
2482.5 Government, Cryptography, and the Right To Privacy - Shearer, Gutmann (1996)(Correct)
The notion of a right to privacy of citizens in their communications is discussed in the context
of an international movement by governments towards regulation of cryptography, and
consideration of... / Computers and Society E. Data Encryption Introduction br The covert regulation of encryption by governments has generally
2482.2 Implementation of Communication Intensive Algorithms On.. - Kapoor (1993)(Correct)
The aim of this thesis has been:
To demonstrate the superiority of the reconfigurable mesh architecture, especially
for communication intensive algorithms, over existing fixed connection
architectures... / . DES Encryption comparison br structure applications was Data Encryption Standard DES DES is a
2464.9 A Formal Semantics for Evaluating Cryptographic Protocols - Yasinsac, Wulf (1993)(Correct)
Much research in the field of network security is concentrated on the technology and application
of cryptography. While the cryptographic methods are heavily investigated to ensure confidence
in the s... / in the strength of the encryption algorithms. However many br is able to compromise the key. Encryption is designed so that such
2450.9 Security on the Move: Indirect Authentication Using Kerberos - Armando Fox (1996)(Correct)
Even as mobile computing and network computing are gaining
momentum, Internet security is sharing the spotlight. Security and
authentication on open networks is difficult even without the
additional r... / that does little more than DES encryption and a Unix-hosted unprivileged br However link-level encryption and authentication solve only
2428.9 Multicast Security and Its Extension to a Mobile Environment - Gong, Shacham (1995)(Correct)
this paper, we consider
fundamental security issues in building a trusted multicast facility. We discuss
techniques for group-based data encryption, authentication of participants, and
preventing unau... / techniques for group-based data encryption authentication of participants br computing authentication encryption. -Introduction A
2423.8 Locally Random Reductions in Interactive Complexity Theory - Feigenbaum (1990)(Correct)
We survey definitions, known results, and open questions in the area of locally random
reductions and explore the ramifications of these reductions in complexity theory.
1 Introduction
We consider th... / protocols for probabilistic encryption GM pseudorandom number br in AFK there they are called encryption schemes for functions and
2386.9 Zero-Knowledge Arguments and Public-Key Cryptography - De Santis, Di Crescenzo, Persiano (1995)(Correct)
In this work we consider the Diffie-Hellman Public-key model in which an additional short random string
is shared by all users. This, which we call Public-Key Public-Randomness (PKPR) model, is very p... / A publishes in a public file his encryption key and keeps secret his br SAT of is based on it. An encryption scheme based on quadratic
2351.9 Parallel Real-Time Cryptography: Beyond Speedup II - Akl, Bruda (1999)(Correct)
The primary purpose of parallel computation is the fast execution of
computational tasks that are too slow to perform sequentially. However, it
was shown recently that a second equally important motiv... / apply only one iteration of an encryption function on each block within br are used n iterations of the encryption function are possible. This
2338.4 Stackable Layers: An Architecture for File System Development - Heidemann (1991)(Correct)
of the Thesis
Stackable Layers:
An Architecture for File System Development
by
John Shelby Heidemann
Master of Science in Computer Science
University of California, Los Angeles, 1991
Professor ... / . Stacking an encryption layer over the UFS. br Figure . illustrates how an encryption layer could be pushed on to an
2294.8 Convergence rates of Markov chains - Rosenthal (1995)(Correct)
this paper, we attempt to describe various mathematical techniques which have
been used to bound such rates of convergence. In particular, we describe eigenvalue analysis,
random walks on groups, coup... / random matrices to be used for encryption algorithms see for example br such as those proposed for encryption algorithms by Sloane In
2283.6 Internet Telephony Gateway Location - Rosenberg (1998)(Correct)
Although the Internet was designed to handle non-real time data traffic, it is being used increasingly to carry voice and video. One important class of contributors to this growth are Internet telepho... / understand. Authentication and encryption are also commonly used in br ITG must support the particular encryption algorithm. This too becomes
2273.3 A Secure and Optimally Efficient Multi-Authority Election Scheme - Cramer, Gennaro, Schoenmakers (1997)(Correct)
In this paper we present a new multi-authority secret-ballot election scheme that guarantees
privacy, universal verifiability, and robustness. It is the first scheme for which the
performance is optim... / the homomorphic properties of the encryption method used the final tally is br published-although breaking the encryption methods for the currently widely
2265.2 Security and Composition of Multi-party Cryptographic Protocols - Canetti (1998)(Correct)
We present general definitions of security for multi-party cryptographic protocols.We show
that, with respect to these definitions, security is preserved under a natural composition operation.
The de... / in to define security of encryption functions and in to define br as in the case of probabilistic encryption or zeroknowledge but
2244.6 Secure and Efficient Off-Line Digital Money - Franklin, Yung (1993)(Correct)
An electronic (or "digital") coin scheme is a set of cryptographic protocols for withdrawal (by a customer from the bank), purchase (by a customer to a vendor), and deposit (by a vendor to the bank), ... / of bits sent between parties and encryption complexity number of br number of applications of encryption operations of all known secure
2222.1 Prudent Engineering Practice for Cryptographic Protocols - Abadi, Needham (1995)(Correct)
We present principles for designing cryptographic protocols. The principles are neither necessary nor sufficient for correctness. They are however helpful, in that adherence to them would have prevent... / Notation Naming Encryption . The uses of encryption br Encryption . The uses of encryption .
2218.2 Adaptively-Secure Distributed Public-Key Systems - Frankel, MacKenzie, Yung (1998)(Correct)
When attacking a distributed protocol, an adaptive adversary
is able to decide its actions (e.g., which parties to corrupt) at any
time based on its entire view of the protocol including the entir... / time. We employ non-binding encryption and develop the notion of br non-committing encryption In fact our full
2206.8 A new paradigm for public key identification - Stern (1996)(Correct)
The present article investigates the possibility of designing zero-knowledge identification
schemes based on hard problems from coding theory. Zero-knowledge proofs
were introduced in 1985, in a paper... / of two matching keys one for encryption and a different one for br of the concept is that the encryption key need not be kept secret.
2196.9 Parallelized Network Security Protocols - Nahum, Yates, O'Malley, Orman.. (1996)(Correct)
Security and privacy are growing concerns in the Internet
community, due to the Internet's rapid growth and the desire
to conduct business over it safely. This desire has led to the
advent of several ... / and RSA. Thus the need to use encryption protocols is increasing. br study that examines how encryption protocol performance can be
2194.7 Key-Schedule Cryptanalysis of IDEA, G-DES, GOST, SAFER, and Triple-DES - Kelsey, Schneier, Wagner (1996)(Correct)
We present new attacks on key schedules of block ciphers.
These attacks are based on the principles of related-key differential cryptanalysis:
attacks that allow both keys and plaintexts to be chose... / bits for later use in an encryption and decryption algorithm. Key br and works against double-encryption with a block cipher and two
2180.5 The BeanChannel: Java distributed event model - Kleindienst(Correct)
This thesis presents a distributed Java event model called BeanChannel.
The BeanChannel, targeted mainly for JavaBeans components, combines
capabilities of the Java Event Delegation Model, COSS Even... / Access Control Data Encryption And Data Security br implement data security and data encryption. Let's overview the sub-goals in
2163.4 Average case reductions for Subset Sum and Decoding of Linear Codes - Arboit (1999)(Correct)
Average case reductions for Subset Sum and Decoding of Linear Codes
Genevi`eve Arboit
Master of Science
Graduate Department of Computer Science
University of Toronto
1999
In a 1996 paper, R. Impagliaz... / for the existence of secure encryption schemes is that NP is not br NP implies only that there exist encryption schemes that are hard to break
2161.6 On The Random-Self-Reducibility Of Complete Sets - Feigenbaum, Fortnow (1991)(Correct)
In this paper, we generalize the previous formal definitions of random-self-reducibility. We show that, even under our very general definition, sets that are complete for any level of the polynomial... / e.g.to achieve probabilistic encryption cf. and br and S. Micali Probabilistic encryption Journal of Computer and System
2136.6 A Symbiotic Relationship Between Formal Methods and Security - Wing (1998)(Correct)
Security played a significant role in the development of formal methods in the 70s and early 80s. Have
the tables turned? Are formal methods now ready to play a significant role in the development of ... / For example public-key encryption is no longer an academic br convenience using a public-key encryption scheme conflicts with
2113.9 Secure Distributed Storage and Retrieval - Juan Garay (1997)(Correct)
In his well-known Information Dispersal Algorithm paper, Rabin showed a way to distribute
information in n pieces among n servers in such a way that recovery of the information is possible
in the pres... / is easily achieved by encryption. Yet this in turn poses the br be achieved through the use of encryption. In fact all the parties are
2112.2 Secrecy by Typing in Security Protocols - Abadi (1998)(Correct)
We develop principles and rules for achieving secrecy properties in security protocols. Our approach is based on traditional classification techniques, and extends those techniques to handle concurren... / In our approach encryption keys are pieces of data and as br explicitly the class Any Encryption keys are data so our
2106.0 Verifiable Partial Key Escrow - Bellare, Goldwasser (1997)(Correct)
One of the main objections to existing proposals for key escrow is that the individual's
privacy relies on too high a level of trust in the law enforcement agencies. In particular, even
if the governm... / manner in a public-key encryption setting. We uncover some subtle br hand widespread use of strong encryption means that in case of suspected
2105.0 Provable security for block Ciphers by decorrelation - Vaudenay (1998)(Correct)
In this paper we investigate a new way for protecting block
ciphers against classes of attacks (including differential and linear cryptanalysis)
which is based on the notion of decorrelation distanc... / the second world war security of encryption used to be based on the secrecy br important research result on encryption was found for the application to
2102.1 Towards an Active Network Architecture - David Tennenhouse (1996)(Correct)
Active networks allow users to inject customized programs into the nodes of the network. In this paper, we describe
our vision of an active network architecture, outline our approach to its design, an... / additional security such as encryption when operating away from the
2088.8 Report on the AES Candidates - Baudron, Gilbert, Granboulan..(Correct)
This document reports the activities of the AES working
group organized at the Ecole Normale Sup'erieure. Several candidates
are evaluated. In particular we outline some weaknesses in the designs of
s... / of the report. Designing the encryption standard of the first twenty br in clock cycles of one block encryption with a -bit key timing of
2088.7 A Group Signature Scheme Based on an RSA-Variant - Camenisch, Michels (1998)(Correct)
The concept of group signatures allows a group member to sign messages
anonymously on behalf of the group. However, in the case of a dispute, the
identity of a signature's originator can be revealed b... / public key of a probabilistic encryption scheme. A user say Alice who br the pair a b is an encryption of u under the revocation
2084.3 Overview about ElGamal related publications from 1984 - 1994 - Horster, Michels, Petersen (1994)(Correct)
Introduction
In this overview we present the relationship between ElGamal based publications from 1984 --
1994. There are 53 references we are aware of, not including textbooks and survey articles.
W... / channels blind signatures encryption schemes authentication and br modul Sun Hwang Authentic encryption Saryazdi
2055.3 The Classification of Hash Functions - Anderson (1993)(Correct)
When we ask what makes a hash function `good', we usually get an
answer which includes collision freedom as the main (if not sole) desideratum.
However, we show here that given any collision-free func... / secret prefix to provide one-way encryption and a hash function such as br modular squaring J the Data Encryption Standard MM M and
2051.8 Principles for designing secure block ciphers and one-way hash.. - Zheng (1990)(Correct)
This thesis is concerned with issues of designing secure (secret-key) block ciphers
and constructing one-way hash functions. Both block ciphers and one-way hash functions
are indispensable to secure i... / . . Compressing via the Rabin Encryption Function br a block cipher called Data Encryption Standard DES NBS DES
2051.6 A case for merging the ILP and DLP paradigms - Quintana, Espasa, Valero (1998)(Correct)
The goal of this paper is to show that instruction
level parallelism (ILP) and data-level parallelism
(DLP) can be merged in a single architecture to execute
regular vectorizable code at a performance... / MPEG processing DSP functions encryption etc. Strengths of the DLP br MPEG processing DSP functions encryption etc. We conjecture that an
2043.6 An Overview of the PKCS Standards - Kaliski, Jr. (1991)(Correct)
This note gives an overview of the PKCS family of standards for public-key cryptography.
These standards cover RSA encryption, Diffie-Hellman key agreement, password-based encryption,
extended-certi... / These standards cover RSA encryption Diffie-Hellman key agreement br key agreement password-based encryption extended-certificate syntax
2042.6 Searching for Elements in Black Box Fields and Applications - Boneh, Lipton (1996)(Correct)
We introduce the notion of a black box field and discuss the problem of explicitly exposing field
elements given in a black box form. We present several sub-exponential algorithms for this problem
usi... / any algebraically homomorphic encryption scheme can be broken in expected br line complexity Homomorphic Encryption Sparse Polynomials.
2029.3 Average-case Analyses of three algorithms for computing the Jacobi.. - Vallée, Lemée (1998)(Correct)
We provide here a complete average--case analysis of the three algorithms for computing the Jacobi
symbol, for positive odd integers less than N . We analyse the average number of steps used for each ... / Blum Shub or probabilistic encryption proposed by Goldswasser and br S. and Micali S. Probabilistic encryption Journal of Computer and
2027.4 Proactive Public Key and Signature Systems - Herzberg, Jakobsson, Jarecki.. (1997)(Correct)
Emerging applications like electronic commerce and secure
communications over open networks have made
clear the fundamental role of public key cryptography
as a unique enabler for world-wide scale sec... / ElGamal-like signatures and encryption undeniable signatures and br our design namely a publickey encryption signature scheme and a
2027.0 Fail-Stop Protocols: An Approach to Designing Secure Protocols - Gong (1994)(Correct)
This paper presents a methodology to facilitate the design and analysis of secure cryptographic protocols. This work is based on a novel notion of a fail-stop protocol, which automatically halts in re... / cryptographic mechanisms such as encryption and decryption algorithms to br party does not possess the encryption key with which the target
2023.0 Encrypted Message Authentication by Firewalls - Gamage, Leiwo, Zheng (1999)(Correct)
Firewalls typically filter network traffic at several different
layers. At application layer, filtering is based on various security relevant
information encapsulated into protocol messages. The maj... / of content protected by encryption. This is due to a traditional br signcryption. Keywords. Encryption Digital Signatures Firewalls
2023.0 The use of Watermarks in the Protection of Digital Multimedia Products - Voyatzis, Pitas (1999)(Correct)
The watermarking of digital images, audio, video and multimedia products in general has been proposed for resolving copyright ownership and verifying originality of content. This paper studies the con... / be used for this purpose. The encryption decryption techniques should br and should achieve real-time encryption decryption e.g. for video and
2018.8 C++ Wrappers for Efficient, Portable, and Flexible Network Programming - Schmidt(Correct)
This paper describes object-oriented (OO) techniques for encapsulating OS interprocess communication (IPC) mechinisms with C++ wrappers. The paper focuses on the C++ wrappers provided by the IPC_SAP c... / Presentation conversions such as encryption compression and network
2018.6 On The Statistical Properties Of Diffie-Hellman Distributions - Canetti, Friedlander, Konyagin.. (1998)(Correct)
Let p be a large prime such that p \Gamma 1 has some large prime factors,
and let # 2 ZZ
p be an r-th power residue for all small factors of p \Gamma 1.
The corresponding Diffie-Hellman (DH) distri... / implicit in the popular ElGamal encryption scheme In fact it is not br the semantic security of El-Gamal encryption Yet other examples where
2001.2 Abstractions for Mobile Computation - Cardelli (1998)(Correct)
ions for Mobile Computation
Luca Cardelli
August 1, 1998
Technical Report
MSR-TR-98-34
Microsoft Research
Microsoft Corporation
One Microsoft Way
Redmond, WA
1
Abstract. We discuss the difficulties... / because of authentication and encryption across domain boundaries. br piece of text can be seen as an encryption of the text in the sense that a
1998.7 What's Interesting? - Schmidhuber (1997)(Correct)
Interestingness depends on the observer's current knowledge and computational abilities.
Things are boring if either too much or too little is known about them --- if they appear
either trivial or ran... / theory are used in today's encryption technology. To draw the line
1998.7 The SwitchWare Active Network Implementation - Alexander, Hicks, Kakkar, Keromytis, .. (1998)(Correct)
Introduction
This is an overview of work on the SwitchWare active
network project, which began two years ago based
on ideas about how to improve the flexibility of networks
by making the network prog... / hashes secret key encryption key establishment and br algorithm the DES encryption algorithm and the SHA
1998.3 ATOMIC: A Low-Cost, Very-High-Speed LAN - Cohen, Finn, Felderman, DeSchon (1992)(Correct)
ATOMIC is an inexpensive O(gigabit) speed LAN built by USC/ISI. It is based
upon Mosaic technology developed for fine-grain, message-passing, massively
parallel computation. Each Mosaic processor is c... / perform complex functions such as encryption or protocol conversion. ATOMIC
1994.7 An Efficient Protocol for Authenticated Key Agreement - Law, Menezes, Qu, Solinas, Vanstone (1998)(Correct)
This paper proposes a new and efficient two-pass protocol for authenticated key agreement in
the asymmetric (public-key) setting. The protocol is based on Diffie-Hellman key agreement and
can be modif... / to achieve confidentiality then encryption with the key can begin on some br other and the non-reliance on encryption to meet export requirements
1990.0 Breaking Security Protocols as an AI Planning Problem - Massacci (1997)(Correct)
Properties like confidentiality, authentication and integrity
are of increasing importance to communication protocols. Hence the development
of formal methods for the verification of security protoc... / shared and public key encryption hashing etc.to guarantee br For example consider the case of encryption. At an high level it is simply a
1988.5 Embedding CSP in PVS. An Application to Authentication Protocols - Dutertre, Schneider (1997)(Correct)
In [28], Schneider applies CSP to the modelling and analysis of authentication protocols
and develops a general proof strategy for verifying authentication properties.
This paper shows how the PVS the... / . Messages and Encryption br related to the particular encryption mechanism used. These specify
1988.3 ACE: The Advanced Cryptographic Engine - Schweinberger, Shoup (2000)(Correct)
This document describes the Advanced Cryptographic Engine (ACE). It specifies a public key encryption scheme as well as a digital signature scheme with enough detail to ensure interoperability between... / It speci es a public key encryption scheme as well as a digital br . . Secure public key encryption .
1983.1 Secure Mediation: Requirements and Design - Biskup, Flegel, Karabulut (1998)(Correct)
In this paper we discuss the security requirements for mediation, and present our approach towards satisfying them, with an emphasis on confidentiality and authenticity. Furthermore we outline the des... / of anonymity and of asymmetric encryption for confidentiality and it can br hidentity address public encryption key public verification
1981.8 Partial Encryption for Image and Video Communication - Cheng (1998)(Correct)
The use of image and video communication has increased dramatically in recent years.
When it is necessary to securely transmit data in limited bandwidth, both compression
and encryption must be perfor... / University of Alberta Partial Encryption for Image and Video br bandwidth both compression and encryption must be performed.
1979.8 Applying Formal Methods to the Analysis of a Key Management Protocol - Meadows (1992)(Correct)
In this paper we develop methods for analyzing key management and authentication protocols using
techniques developed for the solutions of equations in a term rewriting system. In particular, we descr... / its security on a combination of encryption and tamperproof processors that br the notation e X Y to mean the encryption of word Y with key X and d X Y
1976.7 Privacy-Enhanced Electronic Mail - Matt Bishop (1992)(Correct)
The security of electronic mail sent through the Internet may be described in exactly
three words: there is none. The Privacy and Security Research Group has recommended
implementing mechanisms design... / of messages on a network requires encryption whenever the network is br public key cryptosystem the encryption and corresponding decryption
1969.2 Open Issues in Formal Methods for Cryptographic Protocol Analysis - Meadows (2000)(Correct)
The history of the application of formal methods to cryptographic protocol analysis spans nearly twenty years, and recently has been showing signs of new maturity and consolidation. A number of specia... / algebraic properties e.g. the encryption and decryption operations cancel br digital signatures public key encryption and conventional encryption
1960.9 On Hiding Information from an Oracle - Abadi, Feigenbaum, Kilian (1989)(Correct)
We consider the problem of computing with encrypted data. Player A wishes to know the value f(x) for some x but lacks the power to compute it. Player B has the power to compute f and is willing to s... / y for any y. Informally an encryption scheme for the problem f is a br infer x from y. When such an encryption scheme exists we say that f
1949.8 DHAES: An Encryption Scheme Based on the Diffie-Hellman Problem - Abdalla, Bellare, Rogaway (1998)(Correct)
This paper describes a DiÆe-Hellman based encryption scheme, DHAES. The scheme is as eÆcient
as ElGamal encryption, but has stronger security properties. Furthermore, these security properties are
pro... / to IEEE P a. DHAES An Encryption Scheme Based on the br describes a Die-Hellman based encryption scheme DHAES. The scheme is as
1944.5 The\Omega Key Management Service - Reiter, Franklin, Lacy, Wright (1996)(Correct)
In this paper we introduce \Omega\Gamma a distributed public key management service for open networks.\Omega offers interfaces by which clients can register, retrieve, and revoke public keys, and escr... / for the use of strong encryption in some settings. Second some br server S i We denote the encryption of v under public key K i
1942.8 Separating key management from file system security - Mazieres, Kaminsky, Kaashoek, Witchel (1999)(Correct)
No secure network file system has ever grown to span the Internet.
Existing systems all lack adequate key management
for security at a global scale. Given the diversity of the Internet,
any particular... / management to map file names to encryption keys SFS file names effectively br satisfactory means of managing encryption keys in such a large and diverse
1939.9 Meta Message Recovery and Meta Blind signature schemes based on the.. - Horster, Michels, Peterson (1994)(Correct)
There have been several approaches in the past to obtain signature schemes with
message recovery based on the discrete logarithm problem. In this paper we generalize
these approaches into a Meta-Messa... / Meta-schemes like authentic encryption schemes key distribution br these Meta-schemes like authentic encryption schemes key distribution
1927.6 Spread Spectrum Watermarking: Malicious Attacks and Counterattacks - Hartung, Su, Girod (1999)(Correct)
Most watermarking methods for images and video have been proposed are based on ideas from spread spectrum radio communications, namely additive embedding of a (signal adaptive or non-adaptive) pseudo-... / copying without fidelity loss. Encryption and copy protection mechanisms br do not fully solve the issue. Encryption usually protects the data only
1925.3 Nomadic Metacomputing - Patrick Fry(Correct)
This paper describes the Caching DHCP Relay Agent
(CDRA). The CDRA stores local client configuration by caching the data in DHCP server messages.
Using this cached information, the CDRA can respond to... / project for cracking RC and DES encryption keys the GIMPS project br authentication and encryption. Running the metasystem client
1924.8 Watermarking Schemes and Protocols For Protecting Rightful Ownership.. - Qiao, al (1998)(Correct)
Various digital watermarking techniques have been proposed in recent years as methods to protect the copyright of multimedia data. However, as pointed out by the IBM research group, the rightful owner... / include using a standard encryption function such as DES and br of one-way functions rather than encryption algorithms. Equally simple and
1921.4 Securing Threshold Cryptosystems against Chosen Ciphertext Attack - Shoup, Gennaro (1997)(Correct)
For the most compelling applications of threshold cryptosystems, security against chosen
ciphertext attack seems to be a requirement. However, there appear to be no practical threshold
cryptosystems i... / there is a single public encryption key but the corresponding br to the ciphertext during the encryption process. Such a label is a bit
1920.0 A Uniform-Complexity Treatment of Encryption and Zero-Knowledge - Goldreich (1991)(Correct)
We provide a treatment of encryption and zero-knowledge in terms of uniform complexity measures. This treatment is appropriate for cryptographic settings modeled by probabilistic polynomial-time machi... / Uniform-Complexity Treatment of Encryption and Zero-Knowledge Oded br We provide a treatment of encryption and zero-knowledge in terms of
1909.9 Session-Layer Encryption - Blaze, Bellovin (1995)(Correct)
We describe mechanisms for practical session-layer
security for Internet-based terminal sessions. We
discuss the tradeoffs of providing security at various
layers of abstractions, from the network to ... / Session-Layer Encryption Matt Blaze Steven M. Bellovin br those that require end-to-end encryption between machines on opposite
1905.4 How to Break Gifford's Cipher - Cain, Sherman (1994)(Correct)
We present and implement a ciphertext-only algorithm to break Gifford's cipher, a stream
cipher designed in 1984 by David Gifford of MIT and used to encrypt New York Times and
Associated Press wire re... / because they provide fast bulk encryption and because they can be easily br System explains the role of encryption within this system and reviews
1901.3 Implementation of a Network Management Service - Scholtes (1994)(Correct)
Computer networks can be observed and controlled by means of network management
applications. These applications use the management operations as supported by a service, e.g.
a network management serv... / Rules BER initial Data Encryption Standard DES and the Party br Initial Data Encryption Standard implementation.
1894.2 ANSAware and DCE - A Comparison - Adcock, Blair, Hutchinson (1994)(Correct)
The aim of this document is to survey current work in distributed systems
architectures with special emphasis on integrative standards. Two architectures
will be considered in detail. The first is ANS... / set of services such as data encryption synchronisation and remote br ACL's IEEE and the Data Encryption Standard DES Authentication
1888.6 On Some Methods for Unconditionally Secure Key Distribution and.. - Stinson (1996)(Correct)
This paper provides an exposition of methods by which a trusted
authority can distribute keys and/or broadcast a message over a network,
so that each member of a privileged subset of users can compute... / Key Distribution and Broadcast Encryption D. R. Stinson br transmitted through the network. Encryption is often employed in a network
1882.8 Security Benefits from Software Architecture - Bidan, Issarny (1997)(Correct)
In today's field of distributed software architectures there is a need for environments
allowing the easy development of applications consisting of heterogeneous software
modules and having various ... / functionalities such as encryption authentication and access br and access control. Data encryption consists of making the
1876.5 Signcryption and Its Applications in Efficient Public Key Solutions - Zheng (1997)(Correct)
Signcryption is a new paradigm in public key cryptography
that simultaneously fulfills both the functions of digital signature and
public key encryption in a logically single step, and with a cost s... / digital signature and public key encryption in a logically single step and br signature followed by encryption approach. This paper summarizes
1870.4 One-Way Functions and Balanced NP - Lutz(Correct)
The existence of cryptographically secure one-way functions is related
to the measure of a subclass of NP. This subclass, called fiNP
("balanced NP"), contains 3SAT and other standard NP problems.
Th... / BPP secure private key encryption protocols bit br and S. Micali. Probabilistic encryption. Journal of Computer and
1856.1 Cryptography in OpenBSD: An Overview - de Raadt, Hallqvist, Grabowski.. (1999)(Correct)
Cryptographic mechanisms are an important security
component of an operating system in securing
the system itself and its communication paths.
Indeed, in many situations, cryptography is the
only tool... / SSL libraries stronger password encryption Kerberos IV random number br as server authentication and data encryption. The Secure Socket Layer is
1845.4 Fine-Grain Configurability for Secure Communication - Hiltunen, Jaiprakash, Schlichting.. (2000)(Correct)
Current solutions for providing communication security in network applications allow customization
of certain security attributes and techniques, but in limited ways and without the
benefit of a sin... / a message with multiple encryption methods alternating encryption br encryption methods alternating encryption methods or other methods that
1842.7 A New Suggestion for How to Encrypt with RSA - Bellare, Rogaway (1994)(Correct)
Given an arbitrary k-bit to k-bit trapdoor permutation f and a hash function, we exhibit an
encryption scheme for which (i) any string x of length slightly less than k bits can be encrypted
as f(r x )... / appears as Optimal Asymmetric Encryption in Advances in Cryptology - br a hash function we exhibit an encryption scheme for which i any string
1839.8 Executing parallel logical operations with DNA - Ogihara, Ray (1999)(Correct)
DNA computation investigates the potential of DNA as a massively parallel computing device. Research
is focused on designing parallel computation models executable by DNA-based chemical processes
and ... / is the attack on Data Encryption Standard DES In an br molecular computation to the Data Encryption Standard. In L. Landweber and
1837.2 Probable Plaintext Cryptanalysis of the IP Security Protocols - Steven Bellovin (1997)(Correct)
The Internet Engineering Task Force (IETF) is in the
process of adopting standards for IP-layer encryption and
authentication (IPSEC). We describe how "probable plaintext
" can be used to aid in crypt... / adopting standards for IP-layer encryption and authentication IPSEC We br . Introduction DES the Data Encryption Standard is a strong
1825.6 The Anonymous E-mail Conversation - Gülcu (1995)(Correct)
Today, large numbers of people exchange information using electronic means such
as e-mail or news forums. These services make it easy to identify correspondents.
However, under certain circumstances, ... / . . Side effects of encryption br . Notation E x M encryption of string M with X's public key
1825.0 Reconciling Two Views of Cryptography (The Computational Soundness of .. - Abadi, Rogaway (2000)(Correct)
Two distinct, rigorous views of cryptography have developed over
the years, in two mostly separate communities. One of the views relies
on a simple but effective formal approach; the other, on a det... / Computational Soundness of Formal Encryption Mart'in Abadi Bell Labs br for a formal treatment of encryption. Contents Two Views of
1818.5 Encapsulated Key Escrow - Bellare, Goldwasser (1996)(Correct)
The main objection to current key-escrow proposals is that they assume complete faith in
the authority and its trustees. If the authority does not follow the rules, or is replaced by an
un-trustworthy... / Introduction The need to use encryption to guarantee privacy is br files. Widespread use of strong encryption poses however a problem for a
1804.2 Robustness principles for public key protocols - Anderson, Needham (1995)(Correct)
We present a number of attacks, some new, on public key protocols. We also advance a number of principles which may help designers avoid many of the pitfalls, and help attackers spot errors which ca... / some old ones. The Order of Encryption and Signature We will start br on several protocols which do encryption before signature including
1793.8 Protecting Mobile Agents through Tracing - Vigna (1997)(Correct)
Mobile code systems provide a flexible and powerful platform to build distributed applications in an Internet scale, but they rise strong requirements from the security point of view. Security issues ... / a secret key that can be used for encryption and digital signatures br sequel when we will need bulk encryption using public keys we will assume
1791.2 Increasing Availability and Security of an Authentication Service - Gong (1993)(Correct)
Authentication is a process by which one satisfies another about one's claim of identity.
Typically an authentication server provides the authentication service via an authentication
protocol. The a... / are verified agree upon an encryption key-a session key-for later br and M.D. Schroeder Using Encryption for Authentication in Large
1788.4 A HOL Extension of GNY for Automatically Analyzing Cryptographic.. - Brackin (1996)(Correct)
This paper describes a Higher Order Logic (HOL) theory formalizing an extended version of the Gong, Needham, Yahalom (GNY) belief logic, a theory used by software that automatically proves authenticat... / protocols that use multiple encryption and hash operations message br exchanges usually involving encryption intended to establish secure
1783.6 Very large conferences on the Internet: the Internet Multimedia.. - Handley Crowcroft (1999)(Correct)
In this paper we provide an overview of multimedia
conferencing on the Internet. The protocols mentioned
are all specified elsewhere as internet-drafts
or RFCs. Each RFC gives details of the protocol ... / methods are used for encryption and authentication which need br can be implemented using encryption and restricted distribution of
1783.5 A Java Beans Component Architecture for Cryptographic Protocols - Nikander, Karila (1997)(Correct)
Global networking has brought with it both new opportunities
and new security threats on a worldwide scale.
Since the Internet is inherently insecure, secure cryptographic
protocols and a public key i... / they for example cannot leak encryption keys or other secret br security API. Since neither the encryption decryption functionality nor
1776.7 A probabilistic poly-time framework for protocol analysis - Lincoln, Mitchell, Mitchell, Scedrov (1998)(Correct)
We develop a framework for analyzing security protocols in which protocol adversaries may be arbitrary probabilistic polynomial-time processes. In this framework, protocols are written in a form of pr... / primitives. For example encryption is generally considered a br and all protocols relying on encryption would be broken. However in
1770.3 Efficient Protocols for Signing Routing Messages - Zhang (1998)(Correct)
In this work, we aim to reduce the computational costs of using public-key digital signatures in securing routing protocols. Two protocols (COSP and IOSP) using one-time digital signatures are introdu... / systems for efficient data encryption. . Introduction Routing br with public-key systems for data encryption. Since public-key encryption is
1770.1 Interpreting Strands in Linear Logic - Cervesato, Durgin, Kanovich, Scedrov (2000)(Correct)
The adoption of the Dolev-Yao model, an abstraction of security
protocols that supports symbolic reasoning, is responsible
for many successes in protocol analysis. In particular,
it has enabled using ... / not sequences of bits and encryption is modeled in an idealized way. br to public information and E encryption A detailed discussion of
1768.1 D'Agents: Security in a multiple-language, mobile-agent system - Gray, Kotz, Cybenko, Rus (1998)(Correct)
Mobile-agent systems must address three security issues: protecting
an individual machine, protecting a group of machines, and protecting
an agent. In this chapter, we discuss these three issues in ... / a developer can add their own encryption subsystem and then use this br subsystem and then use this encryption subsystem to sign migrating
1760.9 Performance of Cache Coherence in Stackable Filing - John Heidemann (1995)(Correct)
Stackable design of filing systems constructs sophisticated services
from multiple, independently developed layers. This approach has
been advocated to address development problems from code re-use,
t... / hpermissions acm.orgi. UFS encryption OS user Figure A sample br and prototypes of compression and encryption All of these have been
1759.0 2K: A Reflective, Component-Based Operating System for Rapidly.. - Kon (1998)(Correct)
Modern computing environments face both low-frequency infrastructural changes, such as
software and hardware upgrades, and frequent changes, such as fluctuations in the network
bandwidth and CPU load.... / authentication protocols and encryption algorithms should be br variety of authentication and encryption algorithms can be associated
1758.1 Problem Areas for the IP Security Protocols - Bellovin (1996)(Correct)
The Internet Engineering Task Force (IETF) is in
the process of adopting standards for IP-layer encryption
and authentication (IPSEC). We describe
a number of attacks against various versions of these... / adopting standards for IP-layer encryption and authentication IPSEC We br adopting standards for IP-layer encryption and authentication IPSEC