Results 1  10
of
916,763
Complexity measures for publickey cryptosystems
 SIAM Journal on Computing
, 1988
"... The first part of this paper gives results about promise problems. A "promise problem " is a formulation of a partial decision problem that is useful for describing cracking problems for publickey cryptosystems (PKCS). We prove that every NPhard promise problem is uniformly NPhard ..."
Abstract

Cited by 148 (15 self)
 Add to MetaCart
The first part of this paper gives results about promise problems. A "promise problem " is a formulation of a partial decision problem that is useful for describing cracking problems for publickey cryptosystems (PKCS). We prove that every NPhard promise problem is uniformly NP
Quantum publickey cryptosystems
 in Proc. of CRYPT0 2000
, 2000
"... Abstract. This paper presents a new paradigm of cryptography, quantum publickey cryptosystems. In quantum publickey cryptosystems, all parties including senders, receivers and adversaries are modeled as quantum (probabilistic) polytime Turing (QPT) machines and only classical channels (i.e., no q ..."
Abstract

Cited by 37 (2 self)
 Add to MetaCart
Abstract. This paper presents a new paradigm of cryptography, quantum publickey cryptosystems. In quantum publickey cryptosystems, all parties including senders, receivers and adversaries are modeled as quantum (probabilistic) polytime Turing (QPT) machines and only classical channels (i
PublicKey Cryptosystems from Lattice Reduction Problems
, 1996
"... We present a new proposal for a trapdoor oneway function, from whichwe derive publickey encryption and digital signatures. The security of the new construction is based on the conjectured computational difficulty of latticereduction problems, providing a possible alternative to existing publicke ..."
Abstract

Cited by 148 (4 self)
 Add to MetaCart
We present a new proposal for a trapdoor oneway function, from whichwe derive publickey encryption and digital signatures. The security of the new construction is based on the conjectured computational difficulty of latticereduction problems, providing a possible alternative to existing publickey
A Survey of PublicKey Cryptosystems
 SIAM Review 46 (2004) 599– 634. OVERVIEW OF BRAID GROUP CRYPTOGRAPHY 13
"... We give an overview of the most important publickey cryptosystems and discuss the di#cult task of evaluating the merit of such systems. ..."
Abstract

Cited by 16 (0 self)
 Add to MetaCart
We give an overview of the most important publickey cryptosystems and discuss the di#cult task of evaluating the merit of such systems.
Securely Combining PublicKey Cryptosystems
 Proceedings of the ACM Computer and Security Conference
, 2001
"... It is a maxim of sound computersecurity practice that a cryptographic key should have only a single use. For example, an RSA key pair should be used only for publickey encryption or only for digital signatures, and not for both. In this paper we show that in many cases, the simultaneous use of ..."
Abstract

Cited by 19 (1 self)
 Add to MetaCart
of related keys for two cryptosystems, e.g. for a publickey encryption system and for a publickey signature system, does not compromise their security. We demonstrate this for a variety of publickey encryption schemes that are secure against chosenciphertext attacks, and for a variety of digital
Publickey Cryptosystems Provably Secure against Chosen Ciphertext Attacks
 In Proc. of the 22nd STOC
, 1995
"... We show how to construct a publickey cryptosystem (as originally defined by Diffie and Hellman) secure against chosen ciphertext attacks, given a publickey cryptosystem secure against passive eavesdropping and a noninteractive zeroknowledge proof system in the shared string model. No such secure ..."
Abstract

Cited by 284 (20 self)
 Add to MetaCart
We show how to construct a publickey cryptosystem (as originally defined by Diffie and Hellman) secure against chosen ciphertext attacks, given a publickey cryptosystem secure against passive eavesdropping and a noninteractive zeroknowledge proof system in the shared string model
Publickey cryptosystems from the worstcase shortest vector problem
, 2008
"... We construct publickey cryptosystems that are secure assuming the worstcase hardness of approximating the length of a shortest nonzero vector in an ndimensional lattice to within a small poly(n) factor. Prior cryptosystems with worstcase connections were based either on the shortest vector probl ..."
Abstract

Cited by 153 (22 self)
 Add to MetaCart
We construct publickey cryptosystems that are secure assuming the worstcase hardness of approximating the length of a shortest nonzero vector in an ndimensional lattice to within a small poly(n) factor. Prior cryptosystems with worstcase connections were based either on the shortest vector
Statistical mechanics of complex networks
 Rev. Mod. Phys
"... Complex networks describe a wide range of systems in nature and society, much quoted examples including the cell, a network of chemicals linked by chemical reactions, or the Internet, a network of routers and computers connected by physical links. While traditionally these systems were modeled as ra ..."
Abstract

Cited by 2083 (10 self)
 Add to MetaCart
Complex networks describe a wide range of systems in nature and society, much quoted examples including the cell, a network of chemicals linked by chemical reactions, or the Internet, a network of routers and computers connected by physical links. While traditionally these systems were modeled
Modelling a PublicKey Infrastructure
, 1996
"... A global publickey infrastructure (PKI), components of which are emerging in the near future, is a prerequisite for security in distributed systems and for electronic commerce. The purpose of this paper is to propose an approach to modelling and reasoning about a PKI from a user Alice's p ..."
Abstract

Cited by 162 (2 self)
 Add to MetaCart
A global publickey infrastructure (PKI), components of which are emerging in the near future, is a prerequisite for security in distributed systems and for electronic commerce. The purpose of this paper is to propose an approach to modelling and reasoning about a PKI from a user Alice
Reality Mining: Sensing Complex Social Systems
 J. OF PERSONAL AND UBIQUITOUS COMPUTING
, 2005
"... We introduce a system for sensing complex social systems with data collected from one hundred mobile phones over the course of six months. We demonstrate the ability to use standard Bluetoothenabled mobile telephones to measure information access and use in different contexts, recognize social patt ..."
Abstract

Cited by 709 (27 self)
 Add to MetaCart
We introduce a system for sensing complex social systems with data collected from one hundred mobile phones over the course of six months. We demonstrate the ability to use standard Bluetoothenabled mobile telephones to measure information access and use in different contexts, recognize social
Results 1  10
of
916,763