Single-Round Password-Based Key Exchange Protocols
First Claim
Patent Images
1. A method comprising:
- determining a generalized Diffie-Hellman tuple;
generating a one-time simulation-sound zero-knowledge proof proving a consistency of the generalized Diffie-Hellman tuple; and
encrypting a message according to the generalized Diffie-Hellman tuple, wherein the method is performed by a processor.
2 Assignments
Litigations
0 Petitions
Accused Products
Abstract
A method for initializing encrypted communications using a common reference string and a shared password, includes determining a secret key of a peer using a first message, a second message and the common reference string, wherein the first message and the second message each comprise a tuple of elements of a cyclic group G of prime order p, a blinding encryption of the shared password, and a hash projection key.
20 Citations
22 Claims
-
1. A method comprising:
-
determining a generalized Diffie-Hellman tuple; generating a one-time simulation-sound zero-knowledge proof proving a consistency of the generalized Diffie-Hellman tuple; and encrypting a message according to the generalized Diffie-Hellman tuple, wherein the method is performed by a processor.
-
-
2. A method for conducting encrypted communication using a common reference string and a shared password comprising:
-
determining a secret key using a first message sent to a peer, a second message received from the peer and the common reference string, wherein the first message and the second message each comprise a tuple of elements of a cyclic group G of prime order p, a blinding encryption of the shared password, and a hash projection key. - View Dependent Claims (3, 4, 5, 6, 7, 8)
-
-
9. A computer program product for initializing encrypted communications using a common reference string and a shared password, the computer program product comprising:
-
a computer readable storage medium having computer readable program code embodied therewith, the computer readable program code comprising; computer readable program code configured to determine a secret key of a peer using a first message, a second message and the common reference string, wherein the first message and the second message each comprise a tuple of elements of a cyclic group G of prime order p, a blinding encryption of the shared password, and a hash projection key. - View Dependent Claims (10, 11, 12, 13)
-
-
14. A computer program product for initializing encrypted communications using a common reference string and a shared password, the computer program product comprising:
-
a computer readable storage medium having computer readable program code embodied therewith, the computer readable program code comprising; computer readable program code configured to send a first message to a peer; computer readable program code configured to receive a second message from the peer; and computer readable program code configured to determine a secret key of the peer using the first message, the second message and the common reference string, wherein the first message and the second message each comprise a generalized Diffie-Hellman tuple, a blinding encryption of the shared password, a hash projection key, and a one-time simulation-sound zero-knowledge proof proving consistency of the generalized Diffie-Hellman tuple. - View Dependent Claims (15, 16, 17, 18, 19, 20, 21, 22)
-
Specification