Results 1 - 10 of 881

Architectural Support for Fast Symmetric-Key Cryptography

by Jerome Burke, John Mcdonald, Todd Austin - in Proc. Intl. Conf. ASPLOS , 2000
"... The emergence of the Internet as a trusted medium for commerce and communication has made cryptography an essential component of modern information systems. Cryptography provides the mechanisms necessary to implement accountability, accuracy, and confidentiality in communication. As demands for secu ..."
Abstract - Cited by 58 (0 self) - Add to MetaCart
for secure communication bandwidth grow, efficient cryptographic processing will become increasingly vital to good system performance. In this paper, we explore techniques to improve the performance of symmetric key cipher algorithms. Eight popular strong encryption algorithms are examined in detail

Entity Authentication and Key Distribution

by Mihir Bellare, Phillip Rogaway , 1993
"... Entity authentication and key distribution are central cryptographic problems in distributed computing -- but up until now, they have lacked even a meaningful definition. One consequence is that incorrect and inefficient protocols have proliferated. This paper provides the first treatment of these p ..."
Abstract - Cited by 578 (13 self) - Add to MetaCart
of these problems in the complexity-theoretic framework of modern cryptography. Addressed in detail are two problems of the symmetric, two-party setting: mutual authentication and authenticated key exchange. For each we present a definition, protocol, and proof that the protocol meets its goal, assuming

How to leak a secret

by Ronald L. Rivest, Adi Shamir, Yael Tauman - PROCEEDINGS OF THE 7TH INTERNATIONAL CONFERENCE ON THE THEORY AND APPLICATION OF CRYPTOLOGY AND INFORMATION SECURITY: ADVANCES IN CRYPTOLOGY , 2001
"... In this paper we formalize the notion of a ring signature, which makes it possible to specify a set of possible signers without revealing which member actually produced the signature. Unlike group signatures, ring signatures have no group managers, no setup procedures, no revocation procedures, and ..."
Abstract - Cited by 2580 (4 self) - Add to MetaCart
, and no coordination: any user can choose any set of possible signers that includes himself, and sign any message by using his secret key and the others ’ public keys, without getting their approval or assistance. Ring signatures provide an elegant way to leak authoritative secrets in an anonymous way, to sign casual

On Bluetooth Repairing: Key Agreement based on Symmetric-Key Cryptography

by Serge Vaudenay
"... Abstract. Despite many good (secure) key agreement protocols based on publickey cryptography exist, secure associations between two wireless devices are often established using symmetric-key cryptography for cost reasons. The consequence is that common daily used security protocols such as Bluetooth ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
Abstract. Despite many good (secure) key agreement protocols based on publickey cryptography exist, secure associations between two wireless devices are often established using symmetric-key cryptography for cost reasons. The consequence is that common daily used security protocols

Efficient Fuzzy Search on Encrypted Data

by Ra Boldyreva Nathan Chenette , 2014
"... We study the problem of efficient (sub-linear) fuzzy search on encrypted outsourced data, in the symmetric-key setting. In particular, a user who stores encrypted data on a remote untrusted server forms queries that enable the server to efficiently locate the records containing the requested ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
We study the problem of efficient (sub-linear) fuzzy search on encrypted outsourced data, in the symmetric-key setting. In particular, a user who stores encrypted data on a remote untrusted server forms queries that enable the server to efficiently locate the records containing the requested

On-Chip Lookup Tables for Fast Symmetric-Key Encryption

by A. Murat Fiskiran, Ruby B. Lee - PROCEEDINGS OF THE IEEE INTERNATIONAL CONF. ON APPLICATION-SPECIFIC SYSTEMS, ARCHITECTURES AND PROCESSORS , 2005
"... On public communication networks such as the Internet, data confidentiality can be provided by symmetric-key ciphers. One of the most common operations used in symmetric-key ciphers are table lookups. These frequently constitute the largest fraction of the execution time when the ciphers are impleme ..."
Abstract - Cited by 11 (2 self) - Add to MetaCart
On public communication networks such as the Internet, data confidentiality can be provided by symmetric-key ciphers. One of the most common operations used in symmetric-key ciphers are table lookups. These frequently constitute the largest fraction of the execution time when the ciphers

CCproc: A custom VLIW cryptography co-processor for symmetric-key ciphers

by Dimitris Theodoropoulos, Ros Siskos, Dionisis Pnevmatikatos
"... Abstract. In this paper, we present CCProc, a flexible cryptography coprocessor for symmetric-key algorithms. Based on an extensive analysis of many symmetric-key ciphers, including the five AES finalists, we designed an Instruction Set Architecture tailored to symmetric-key ciphers and built a hard ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
Abstract. In this paper, we present CCProc, a flexible cryptography coprocessor for symmetric-key algorithms. Based on an extensive analysis of many symmetric-key ciphers, including the five AES finalists, we designed an Instruction Set Architecture tailored to symmetric-key ciphers and built a

Selecting Cryptographic Key Sizes

by Arjen K. Lenstra, Eric R. Verheul - TO APPEAR IN THE JOURNAL OF CRYPTOLOGY, SPRINGER-VERLAG , 2001
"... In this article we offer guidelines for the determination of key sizes for symmetric cryptosystems, RSA, and discrete logarithm based cryptosystems both over finite fields and over groups of elliptic curves over prime fields. Our recommendations are based on a set of explicitly formulated parameter ..."
Abstract - Cited by 323 (8 self) - Add to MetaCart
In this article we offer guidelines for the determination of key sizes for symmetric cryptosystems, RSA, and discrete logarithm based cryptosystems both over finite fields and over groups of elliptic curves over prime fields. Our recommendations are based on a set of explicitly formulated

Analysis of key-exchange protocols and their use for building secure channels

by Ran Canetti, Hugo Krawczyk , 2001
"... Abstract. We present a formalism for the analysis of key-exchange protocols that combines previous definitional approaches and results in a definition of security that enjoys some important analytical benefits: (i) any key-exchange protocol that satisfies the security definition can be composed with ..."
Abstract - Cited by 330 (20 self) - Add to MetaCart
with symmetric encryption and authentication functions to provide provably secure communication channels (as defined here); and (ii) the definition allows for simple modular proofs of security: one can design and prove security of key-exchange protocols in an idealized model where the communication links

Parallelizable Authentication Trees

by Eric Hall, Charanjit S. Jutla - In Cryptology ePrint Archive , 2002
"... We define a new authentication tree in the symmetric key setting, which has the same computational, storage and security parameters as the well known Merkle Authentication Tree, but which unlike the latter, allows for all the cryptographic operations required for an update to be performed in para ..."
Abstract - Cited by 17 (0 self) - Add to MetaCart
We define a new authentication tree in the symmetric key setting, which has the same computational, storage and security parameters as the well known Merkle Authentication Tree, but which unlike the latter, allows for all the cryptographic operations required for an update to be performed
Results 1 - 10 of 881