Public Key Cryptography - PKC 2007: 10th International Conference on Practice and Theory in Public-Key Cryptography, Beijing, China, April 16-20, 2007, ProceedingsTatsuaki Okamoto, Xiaoyun Wang Springer, 2007. gada 21. jūn. - 498 lappuses This book constitutes the refereed proceedings of the 10th International Conference on Practice and Theory in Public-Key Cryptography, PKC 2007, held in Beijing, China in April 2007. The 29 revised full papers presented together with two invited lectures are organized in topical sections on signatures, cryptanalysis, protocols, multivariate cryptosystems, encryption, number theoretic techniques, and public-key infrastructure. |
No grāmatas satura
1.–5. rezultāts no 69.
5. lappuse
... independent uniform random λ-bit primes, G and GT are cyclic groups of order n = pq with efficiently computable group operations (over their respective elements, which must have a polynomial size representation in λ), and e : G × G ...
... independent uniform random λ-bit primes, G and GT are cyclic groups of order n = pq with efficiently computable group operations (over their respective elements, which must have a polynomial size representation in λ), and e : G × G ...
17. lappuse
... independently performs cryptographic computations inside itself, and even its manufacturer cannot obtain knowledge of these computations. TPMs are embedded into computing devices by a device manufacturer, and these devices are called ...
... independently performs cryptographic computations inside itself, and even its manufacturer cannot obtain knowledge of these computations. TPMs are embedded into computing devices by a device manufacturer, and these devices are called ...
32. lappuse
... to computational indistinguishability where the output appears to be random for efficient observers. We will use this algorithmic relaxation throughout the paper. independent outputs H(m) = H(0,m) and Ext(m) = H(1,m) for. 32 M. Fischlin.
... to computational indistinguishability where the output appears to be random for efficient observers. We will use this algorithmic relaxation throughout the paper. independent outputs H(m) = H(0,m) and Ext(m) = H(1,m) for. 32 M. Fischlin.
33. lappuse
... independent outputs H(m) = H(0,m) and Ext(m) = H(1,m) for non-trivially distributed messages m. Note that with this instantiation the derived signature scheme is basically as efficient as the original scheme. To get a solution in the ...
... independent outputs H(m) = H(0,m) and Ext(m) = H(1,m) for non-trivially distributed messages m. Note that with this instantiation the derived signature scheme is basically as efficient as the original scheme. To get a solution in the ...
36. lappuse
... independent random output) are computationally indistinguishable: – Let K ← HKGen(1n), x ← X(1n), y ← H(K, x;r) ... independent and uniformly distributed. To get a solution in the standard model, which is only slightly less efficient ...
... independent random output) are computationally indistinguishable: – Let K ← HKGen(1n), x ← X(1n), y ← H(K, x;r) ... independent and uniformly distributed. To get a solution in the standard model, which is only slightly less efficient ...
Saturs
1 | |
16 | |
31 | |
43 | |
Cryptanalysis of GroupBased Key AgreementProtocols Using Subgroup Distance Functions | 61 |
Cryptanalysis of AnshelAnshelGoldfeld KeyExchange Protocol | 76 |
New ChosenCiphertext Attacks on NTRU | 89 |
Cryptanalysis of the PaengJungHaCryptosystem from PKC 2003 | 107 |
Invertible Cycles for Multivariate QuadraticMQ Public Key Cryptography | 266 |
ChosenCiphertext Secure KeyEncapsulationBased on Gap Hashed DiffieHellman | 282 |
Parallel KeyInsulated Public Key EncryptionWithout Random Oracles | 298 |
Multibit Cryptosystems Based on LatticeProblems | 315 |
Practical and Secure Solutionsfor Integer Comparison | 330 |
Multiparty Computationfor Interval Equality and ComparisonWithout BitDecomposition Protocol | 343 |
IdentityBased Traitor Tracing | 361 |
Verifiable Shuffle of Large Size Ciphertexts | 377 |
Optimistic Fair Exchangein a Multiuser Setting | 118 |
Multiparty StandAlone and SetupFreeVerifiably Committed Signatures | 134 |
KnowledgeBinding Commitments with Applications inTimeStamping | 150 |
Efficient Ring SignaturesWithout Random Oracles | 166 |
Traceable Ring Signature | 181 |
TwoTier Signatures Strongly UnforgeableSignatures and FiatShamir Without RandomOracles | 201 |
Improved OnLineOffLine ThresholdSignatures | 217 |
High Order Linearization Equation HOLEAttack on Multivariate Public KeyCryptosystems | 233 |
Cryptanalysis of HFE with Internal Perturbation | 249 |
Techniques and Applications | 393 |
Deterministic Polynomial Time EquivalenceBetween Factoring and KeyRecovery Attack onTakagis RSA | 412 |
Efficient Pseudorandom Generators Based onthe DDH Assumption | 426 |
Fast Batch Verification of Multiple Signatures | 442 |
Security and Efficiency | 458 |
SelfGeneratedCertificate Public KeyEncryption Without Pairing | 476 |
Author Index | 490 |
Bieži izmantoti vārdi un frāzes
addition advantage adversary algorithm allows anonymous apply assume assumption attack called certificate challenge chosen ciphertext commitment communication complexity compute confirmer consider construction corresponding cryptosystem decryption defined definition denote described distinguish distribution efficient elements encryption scheme equations exists field function given hash function Hence identity independent input integer knowledge lattice length linear LNCS means method multiplication Note obtain outputs pair parameters partial parties polynomial positive practical present prime private key probability problem produce proof proposed protocol prove public key queries random random oracle require respect result returns ring signature rounds Science secret key shared signature scheme signer signing simulation solve Springer-Verlag standard step subgroup takes Theorem University valid verifier volume
Populāri fragmenti
409. lappuse - C. Cachin, S. Micali and M. Stadler. Computationally private information retrieval with polylogarithmic communication. In Advances in Cryptology - Eurocrypt '99.
201. lappuse - Dept. of Electrical and Computer Engineering, University of California, San Diego, 9500 Gilman Drive, La Jolla, CA 92093-0407, Email:wnakagaw@ucsd.edu, gklemens@ucsd.edu, fainman&ece.
117. lappuse - O. Goldreich, S. Goldwasser, and S. Halevi. Publickey cryptosystems from lattice reduction problems.