FEEDBACK Smiley face

Topics in Cryptology — CT-RSA 2002 (Record no. 15482)

000 -LEADER
fixed length control field 05138nam a22005895i 4500
001 - CONTROL NUMBER
control field 978-3-540-45760-2
003 - CONTROL NUMBER IDENTIFIER
control field DE-He213
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20170515111539.0
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION
fixed length control field cr nn 008mamaa
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 121227s2002 gw | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9783540457602
-- 978-3-540-45760-2
024 7# - OTHER STANDARD IDENTIFIER
Standard number or code 10.1007/3-540-45760-7
Source of number or code doi
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA76.9.A25
072 #7 - SUBJECT CATEGORY CODE
Subject category code URY
Source bicssc
072 #7 - SUBJECT CATEGORY CODE
Subject category code COM053000
Source bisacsh
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 005.82
Edition number 23
245 10 - TITLE STATEMENT
Title Topics in Cryptology — CT-RSA 2002
Medium [electronic resource] :
Remainder of title The Cryptographers’ Track at the RSA Conference 2002 San Jose, CA, USA, February 18–22, 2002 Proceedings /
Statement of responsibility, etc edited by Bart Preneel.
264 #1 -
-- Berlin, Heidelberg :
-- Springer Berlin Heidelberg,
-- 2002.
300 ## - PHYSICAL DESCRIPTION
Extent X, 318 p.
Other physical details online resource.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- rda
490 1# - SERIES STATEMENT
Series statement Lecture Notes in Computer Science,
International Standard Serial Number 0302-9743 ;
Volume number/sequential designation 2271
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note Public Key Cryptography -- On Hash Function Firewalls in Signature Schemes -- Observability Analysis - Detecting When Improved Cryptosystems Fail - -- Efficient Hardware Implementations -- Precise Bounds for Montgomery Modular Multiplication and Some Potentially Insecure RSA Moduli -- Montgomery in Practice: How to Do It More Efficiently in Hardware -- MIST: An Efficient, Randomized Exponentiation Algorithm for Resisting Power Analysis -- An ASIC Implementation of the AES SBoxes -- Public Key Cryptography: Theory -- On the Impossibility of Constructing Non-interactive Statistically-Secret Protocols from Any Trapdoor One-Way Function -- The Representation Problem Based on Factoring -- Symmetric Ciphers -- Ciphers with Arbitrary Finite Domains -- Known Plaintext Correlation Attack against RC5 -- E-Commerce and Applications -- Micropayments Revisited -- Proprietary Certificates -- Stateless-Recipient Certified E-Mail System Based on Verifiable Encryption -- Digital Signatures -- RSA-Based Undeniable Signatures for General Moduli -- Co-operatively Formed Group Signatures -- Transitive Signature Schemes -- Homomorphic Signature Schemes -- Public Key Encryption -- GEM: A Generic Chosen-Ciphertext Secure Encryption Method -- Securing “Encryption + Proof of Knowledge” in the Random Oracle Model -- Discrete Logarithm -- Nonuniform Polynomial Time Algorithm to Solve Decisional Diffie-Hellman Problem in Finite Fields under Conjecture -- Secure Key-Evolving Protocols for Discrete Logarithm Schemes.
520 ## - SUMMARY, ETC.
Summary, etc This volume continues the tradition established in 2001 of publishing the c- tributions presented at the Cryptographers’ Track (CT-RSA) of the yearly RSA Security Conference in Springer-Verlag’s Lecture Notes in Computer Science series. With 14 parallel tracks and many thousands of participants, the RSA - curity Conference is the largest e-security and cryptography conference. In this setting, the Cryptographers’ Track presents the latest scienti?c developments. The program committee considered 49 papers and selected 20 for presen- tion. One paper was withdrawn by the authors. The program also included two invited talks by Ron Rivest (“Micropayments Revisited” – joint work with Silvio Micali) and by Victor Shoup (“The Bumpy Road from Cryptographic Theory to Practice”). Each paper was reviewed by at least three program committee members; paperswrittenbyprogramcommitteemembersreceivedsixreviews.Theauthors of accepted papers made a substantial e?ort to take into account the comments intheversionsubmittedtotheseproceedings.Inalimitednumberofcases,these revisions were checked by members of the program committee. I would like to thank the 20 members of the program committee who helped to maintain the rigorous scienti?c standards to which the Cryptographers’ Track aims to adhere. They wrote thoughtful reviews and contributed to long disc- sions; more than 400 Kbyte of comments were accumulated. Many of them - tended the program committee meeting, while they could have been enjoying the sunny beaches of Santa Barbara.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer science.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Operating systems (Computers).
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Data encryption (Computer science).
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computers.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Algorithms.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer science
General subdivision Mathematics.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Management information systems.
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer Science.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Data Encryption.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Theory of Computation.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Operating Systems.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Discrete Mathematics in Computer Science.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Management of Computing and Information Systems.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Algorithm Analysis and Problem Complexity.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Preneel, Bart.
Relator term editor.
710 2# - ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element SpringerLink (Online service)
773 0# - HOST ITEM ENTRY
Title Springer eBooks
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Display text Printed edition:
International Standard Book Number 9783540432241
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
Uniform title Lecture Notes in Computer Science,
-- 0302-9743 ;
Volume number/sequential designation 2271
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier http://dx.doi.org/10.1007/3-540-45760-7
912 ## -
-- ZDB-2-SCS
912 ## -
-- ZDB-2-LNC
912 ## -
-- ZDB-2-BAE
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme
Koha item type e-Book

No items available.


© IIIT-Delhi, 2013 | Phone: +91-11-26907510| FAX +91-11-26907405 | E-mail: library@iiitd.ac.in