Tuesday, 31 August 2010

What the hell it is?!!!!

Notes on Foundations of Cryptography - A Primer



1) Stronger versus Weak One-Way Functions

   Stronger: for any feasible ppt algorithm:  succeeds in inverting the function with negligible probability.

   Weaker:  for any feasible ppt algorithm:  fails in inverting the function with noticeble probability.


2) Reducibility argument

Monday, 30 August 2010

Recent Target (Reading two papers)

1. General Cryptographic Protocols: The Very Basics


2. Foundations of Cryptography - A Primer

Interesting quotations in this paper:

   1)  It is possible to build a cabin with no foundations, but not a lasting
       building.

       Eng. Isidor Goldreich (1906-1995) Who?

   2) Indistinguishable things are identical (or should be considered as identical).
    
      The Principle of Identity of Indiscernibles
    
      G.W. Leibniz (1646-1714)

   3) A proof is whatever convinces me.

      Shimon Even (1935-2004)

      http://en.wikipedia.org/wiki/Shimon_Even

   4) A good compromise is one in which the most important interests of all

      parties are satisfied.

     Adv. Klara Goldreich-Ingwer (1912-2004)
    

Both are the works of Oded Goldreich.


Notes on : General Cryptographic Protocols: The Very Basics

[24] R. Cleve. Limits on the security of Coin Flips when Half the Processors are Faulty. In STOC 1986

Provide a conclusion that:  there is no way to prevent a party from prematurely suspending the execution.

[hence] "in the case of two-party computation, secure computation is possible only if premature termination is not considered a breach of security"

[but in real applications, premature termination could compromise the security. How to deal with this? ]

"an alternative way of dealing with the problem of premature suspension of execution is to restrict our attention to single-output functionalities; that is, functionalities in which only one party is supposed to obtain an output." [as RFID?]

then "the definition of secure computation of such functionalities can be made identical to Definition 1, with the exception that no restriction is made on the set of dishonest parties (and in particular one may consider a single dishonest party in the case of two-party protocols.)” [in RFID, only reader could be dishonest? only tag?]  [what's definition 1's restriction on the two parties? ] [Details in "Foundations of cryptography" Sec. 7.2.3]

[Do the models mention in this paper deal with the inner state updating? Or RFID models? The latest one, Prof. Zhao's model]

[The role of reader and tag are not symmetric]

[concurrent consideration in RFID is meaningless?....Adversary can get information by interfereing with two roles? ]

[Cannot understand 4.1.1, 4.1.2]

Thursday, 26 August 2010

Gap

Top scientists publish paper on top journal and conference?  They  cite the papers only from top journal and conference.   (they communication with their special language)
Rank 1 paper authors cite several papers from top journal and conference, and other references from rank 1 papers.

Rank 2 papers' authors follow rank 1 authors. They seldom understand the top works. But they can do something based on rank 1 papers.

Rank 3 papers' authors follow rank 2 authors. Have no idea what the top scientists are doing.

Like human being, one can know his father well, and if lucky enough, he also can know his grandfather well... But quite a few people can know his grandgrandfather
-_-!......  I think no one know clearly that where we come from....Monkey?


Monday, 23 August 2010

Economics

Economics http://en.wikipedia.org/wiki/Economics
(classification of Economics in this page is not clear)


History of economic thought  http://en.wikipedia.org/wiki/History_of_economic_thought


Outline of Economics: http://en.wikipedia.org/wiki/Outline_of_economics



Economics aims to explain how economies work and how economicagents interact. Economic analysis is applied throughout society, in businessfinance and government, but also in crime,[3]education,[4] the familyhealthlawpoliticsreligion,[5]social institutions, war,[6] and science.[7] The expanding domain of economics in the social sciences has been described as economic imperialism.[8] (from http://en.wikipedia.org/wiki/Economics)






Common distinctions are drawn between various dimensions of economics. The primary textbook distinction is betweenmicroeconomics, which examines the behavior of basic elements in the economy, including individual markets and agents (such as consumers and firms, buyers and sellers), and macroeconomics, which addresses issues affecting an entire economy, including unemployment, inflation, economic growth, and monetary and fiscal policy. Other distinctions include: between positive economics (describing "what is") and normative economics (advocating "what ought to be"); between economic theory and applied economics; between mainstream economics (more "orthodox" dealing with the "rationality-individualism-equilibrium nexus") and heterodox economics (more "radical" dealing with the "institutions-history-social structure nexus"[9]); and between rational and behavioral economics.   
(from http://en.wikipedia.org/wiki/Economics)



Subdisciplines


(from http://en.wikipedia.org/wiki/Economics)

Methodology


(from http://en.wikipedia.org/wiki/Economics)



Sunday, 22 August 2010

Algorithm

Design of Algorithms Eight paradigms:

1. reduce to known problem (eg. graph problem)

2. divide and conquer

3. greedy algorithm

4. dynamic programming

5. branch and bound search

6. local search

7. metaheuristics: tabu search, genetic algorithms, simulated annealing, etc.

8. randomized/probabilistic algorithm

Saturday, 21 August 2010

Friday, 20 August 2010

What is in AO-OSK?




 First:   Used to expedite the cryptanalysis
 

A cryptanalytic time-memory trade-off - Hellman - 被引用次数:329  
    IEEE transactions on Information Theory  1980


Rigorous time/space tradeoffs for inverting functions   citation: 45
psu.edu [PDF]A Fiat, M Naor  1991

Making a faster cryptanalytic time-memory trade-off - Philippe Oechslin - 被引用次数:161
crypto 2003

 In stream cipher application
Cryptanalytic time/memory/data tradeoffs for stream … - Biryukov - 被引用次数:175

In RFID application:

A scalable and provably secure hash-based RFID protocol

G Avoine, P Oechslin -  Percomm 2005

  
use the time-memory trade-off to facilitate the tag identification on reader      side

Awards in Computer Science

Computer related awards:
http://en.wikipedia.org/wiki/Category:Computer-related_awards

Computer Science awards:
http://en.wikipedia.org/wiki/Category:Computer_science_awards




Turing Award  http://en.wikipedia.org/wiki/Turing_Award

Bibliography of Turing Award Lectures
http://www.informatik.uni-trier.de/~ley/db/journals/cacm/turing.html



Knuth Prize




Gödel Prize

Computer Science Conferences

Conference list in computer science

http://en.wikipedia.org/wiki/List_of_computer_science_conferences

Compuetr Science Conference Ranking
http://webdocs.cs.ualberta.ca/~zaiane/htmldocs/ConfRanking.html

Computer Science Conference Ranking
http://www3.ntu.edu.sg/home/assourav/crank.htm

Security conferences
http://gu.iscas.ac.cn/bbs/archiver/?tid-49.html

microsoft list
http://libra.msra.cn/RankList?entitytype=3&domainID=2&last=0&start=1&end=100
Rank 0:   STOC, FOCS,SODA
http://www.cs.utah.edu/~suresh/citations/

STOC Symposium on Theory of computing
FOCS Sympsium on Foundations of Computer Science

  Wiki link: http://en.wikipedia.org/wiki/Symposium_on_Theory_of_Computing

SODA  


Rank 1:


Database:  


       SIGMOD : ACM SIGMOD Conf on Management of Data

       PODS: ACM SIGMOD Conf on Principles of DB Systems
       VLDB: Very Large Data Bases
       ICDE: Intl Conf on Data Engineering
       CIKM: Intl. Conf on Information and Knowledge Management
       ICDT: Intl Conf on Database Theory

Artificial Intelligence and Related Subjects

AAAI: American Association for AI National Conference
CVPR: IEEE Conf on Comp Vision and Pattern Recognition
IJCAI: Intl Joint Conf on AI
ICCV: Intl Conf on Computer Vision
ICML: Intl Conf on Machine Learning
KDD: Knowledge Discovery and Data Mining
KR: Intl Conf on Principles of KR & Reasoning
NIPS: Neural Information Processing Systems
UAI: Conference on Uncertainty in AI
AAMAS: Intl Conf on Autonomous Agents and Multi-Agent Systems (past: ICAA)
ACL: Annual Meeting of the ACL (Association of Computational Linguistics)


Applications and Media


I3DG: ACM-SIGRAPH Interactive 3D Graphics
SIGGRAPH: ACM SIGGRAPH Conference
ACM-MM: ACM Multimedia Conference
DCC: Data Compression Conf
SIGMETRICS: ACM Conf on Meas. & Modelling of Comp Sys
SIGIR: ACM SIGIR Conf on Information Retrieval
PECCS: IFIP Intl Conf on Perf Eval of Comp \& Comm Sys
WWW: World-Wide Web Conferenc





Algorithms and Theory


COCOON  Computing and combinatorics
SPAA: ACM Symp on Parallel Algorithms and Architectures 




Communication: SIGCOMM, INFORCOM, MobiCom

Security: S&P

CCS, USENIX

Cryptography:  Crypto, Eurocrypt


Rank 2: 

ESORICS, NDSS, CSF, Wisec, AsiaCCS, ACSAC, SACMAT, FC


RANK 3:


ACNS ICICS  ACISP Securecomm

Thursday, 19 August 2010

Tuesday, 17 August 2010

What is computer science



Theoretical computer science

Theoretical computer science includes computability theorycomputational complexity theory, and information theory. Computability theory examines the limitations of various theoretical models of the computer, including the most powerful known model – the Turing machine. Complexity theory is the study of tractability by computer; some problems, although theoretically solvable by computer, are so expensive in terms of time or space that solving them is likely to remain practically unfeasible, even with rapid advance of computer hardware. A famous problem is the "P=NP?" problem, one of the Millennium Prize Problems.[35] Finally, information theory is concerned with the amount of data that can be stored on a given medium, and hence deals with concepts such as compression and entropy.



http://en.wikipedia.org/wiki/ACM_Computing_Classification_System 

How does a new discipline begin?  

Such as econsec ...

Environmental  economics

First one

I'd like to record the work I do in each day.  So that I can know how I spend the time,  and how I progress by time.  

In this morning,  I read the course introduction for Prof Lau's "Decision Support and Optimization"    
It will have three assignments in this term and one mid-term exam, and perhaps one presentation.

In this afternoon, I explored Ross Anderson's page  http://www.cl.cam.ac.uk/~rja14/econsec.html.
Seems they are  developing econsec as a new discipline. 
I printed each years' accepted paper list.  Read the titles first.

Anderson also provided a name list of the scientists that work on this new discipline.  I think I should get familiar with the chief scientists on this field too.