NDLI: The Fine Print of Security

Content Provider	IEEE Xplore Digital Library
Author	Abadi, M.
Copyright Year	2010
Abstract	Simple views of systems are often convenient in their design and analysis. However, attackers may attempt to exploit any oversimplification. For security, it is therefore useful to understand the value and the limitations of simplistic models. Computational-soundness theorems, which are the main subject of this lecture, can sometimes shed light on this question. We discuss them first in the context of security protocols. There, two distinct, rigorous views of cryptography have developed over the years. One of the views relies on a simple but powerful symbolic approach; the other, on a detailed computational model that considers issues of probability and complexity. In the last decade, however, we have made substantial progress in bridging the gap between these views. This progress, of which a paper with Phil Rogaway was one of the early steps, is due to many researchers. By now, this line of work provides computational justifications for formal treatments of cryptographic operations and security protocols, and also explores hybrid approaches. Similar ideas can apply in the domain of software protection, although they are less mature in this domain. Specifically, we can relate high-level security guarantees, of the kind offered by programming-language semantics, with lower-level properties of implementations. Layout randomization, one popular and effective implementation technique, again brings up issues of probability and complexity. The lecture introduces some recent work with Gordon Plotkin on this topic.
Starting Page	110
Ending Page	110
File Size	178079
Page Count	1
File Format	PDF
ISBN	9781424475889
ISSN	10436871
e-ISBN	9781424475896
DOI	10.1109/LICS.2010.9
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2010-07-11
Publisher Place	United Kingdom
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Cryptography Computational modeling Complexity theory Protocols Semantics Silicon
Content Type	Text
Resource Type	Article
Subject	Mathematics Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Modeling Security Protocols as Games

Timed protocols insecurity problem is NP-complete

Provable Implementations of Security Protocols

Modeling security protocols using operational semantics

Computational and information-theoretic soundness and completeness of formal encryption

LICS: Logic in Computer Security -- Some Attacker's Models and Related Decision Problems

Information-Theoretically Secure Protocols and Security under Composition

On Basing ZK ≠ BPP on the Hardness of PAC Learning

The Complexity of Decomposing Modal and First-Order Theories

The Fine Print of Security

Similar Documents

Modeling Security Protocols as Games

Timed protocols insecurity problem is NP-complete

Provable Implementations of Security Protocols

Modeling security protocols using operational semantics

Computational and information-theoretic soundness and completeness of formal encryption

LICS: Logic in Computer Security -- Some Attacker's Models and Related Decision Problems

Information-Theoretically Secure Protocols and Security under Composition

On Basing ZK ≠ BPP on the Hardness of PAC Learning

The Complexity of Decomposing Modal and First-Order Theories

The Fine Print of Security