My Account Log in

1 option

Provable Security : Third International Conference, ProvSec 2009, Guangzhou, China, November 11-13, 2009. Proceedings / edited by Josef Pawel Pieprzyk, Fangguo Zhang.

SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024) Available online

View online
Format:
Book
Contributor:
Pieprzyk, Josef Pawel, editor.
Zhang, Fangguo, editor.
SpringerLink (Online service)
Series:
Computer Science (Springer-11645)
LNCS sublibrary. Security and cryptology ; SL 4, 5848.
Security and Cryptology ; 5848
Language:
English
Subjects (All):
Data encryption (Computer science).
Data structures (Computer science).
Computer science--Mathematics.
Computer science.
Coding theory.
Information theory.
Cryptology.
Data Structures and Information Theory.
Mathematics of Computing.
Discrete Mathematics in Computer Science.
Symbolic and Algebraic Manipulation.
Coding and Information Theory.
Local Subjects:
Cryptology.
Data Structures and Information Theory.
Mathematics of Computing.
Discrete Mathematics in Computer Science.
Symbolic and Algebraic Manipulation.
Coding and Information Theory.
Physical Description:
1 online resource (XII, 275 pages).
Edition:
First edition 2009.
Contained In:
Springer eBooks
Place of Publication:
Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2009.
System Details:
text file PDF
Summary:
This book constitutes the refereed proceedings of the Third International Conference on Provable Security, ProvSec 2009, held in Guangzhou, China, November 11-13, 2009. The 19 revised full papers and two invited talks presented were carefully reviewed and selected from 64 submissions. The papers are organized in topical sections on encryption, digital signature, cryptographic protocols and reduction and privacy.
Contents:
Invited Talks
A Brief History of Security Models for Confidentiality
Symbolic Methods for Provable Security
Encryption
Efficient Non-interactive Universally Composable String-Commitment Schemes
Spatial Encryption under Simpler Assumption
Chosen-Ciphertext Secure RSA-Type Cryptosystems
Anonymous Conditional Proxy Re-encryption without Random Oracle
Breaking and Fixing of an Identity Based Multi-Signcryption Scheme
Digital Signatures
Identity-Based Verifiably Encrypted Signatures without Random Oracles
How to Prove Security of a Signature with a Tighter Security Reduction
Twin Signature Schemes, Revisited
On the Insecurity of the Fiat-Shamir Signatures with Iterative Hash Functions
Is the Notion of Divisible On-Line/Off-Line Signatures Stronger than On-Line/Off-Line Signatures?
Anonymous Signatures Revisited
Cryptographic Protocols
An eCK-Secure Authenticated Key Exchange Protocol without Random Oracles
Password Authenticated Key Exchange Based on RSA in the Three-Party Settings
Comparing SessionStateReveal and EphemeralKeyReveal for Diffie-Hellman Protocols
Zero-Knowledge Protocols for NTRU: Application to Identification and Proof of Plaintext Knowledge
Server-Controlled Identity-Based Authenticated Key Exchange
Reductions and Privacy
Oracle Separation in the Non-uniform Model
GUC-Secure Set-Intersection Computation
Self-enforcing Private Inference Control.
Other Format:
Printed edition:
ISBN:
978-3-642-04642-1
9783642046421
Access Restriction:
Restricted for use by site license.

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

Find

Home Release notes

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Find catalog Using Articles+ Using your account