Filters








8,806 Hits in 3.2 sec

The global power of additional queries to random oracles [chapter]

Ronald V. Book, Jack H. Lutz, David M. Martin
1994 Lecture Notes in Computer Science  
k queries in *any* amount of time to *any* algorithmically random language C.  ...  to B but not truth-table reducible in k queries in any amount of time to any algorithmically random language C.  ...  For all k 2 N, P k-tt RAND $ P k+1-tt RAND: The Main Theorem shows that allowing additional queries to random oracles does allow new languages to be computed.  ... 
doi:10.1007/3-540-57785-8_158 fatcat:eeagwxwmkfgrtonpmvmikxke6m

The Global Power of Additional Queries to Random Oracles

R.V. Book, J.H. Lutz, D.M. Martin
1995 Information and Computation  
k queries in any amount of time to any algorithmically random language C.  ...  It is shown that, for every k 0 and every xed algorithmically random language B, there is a language that is polynomial-time, truthtable reducible in k + 1 queries to B but not truth-table reducible in  ...  For all k 2 N, P k-tt RAND $ P k+1-tt RAND: The Main Theorem shows that allowing additional queries to random oracles does allow new languages to be computed.  ... 
doi:10.1006/inco.1995.1097 fatcat:f2tbvsxo2jaw3i4xlzbqu4vhza

The Global Power of Additional Queries to p-Random Oracles [chapter]

Wolfgang Merkle
2000 Lecture Notes in Computer Science  
to any other p-random set with at most k queries.  ...  Second, we show that the separation result above can be transferred from the setting of polynomial time-bounds to a setting of rec-random sets and recursive reducibilities.  ...  We are grateful to Elvira Mayordomo for several useful corrections and suggestions, where the latter include a significant simplification of the argument in Remark 4.2 via referring to the cited result  ... 
doi:10.1007/3-540-45022-x_77 fatcat:ksexljd73jgo3dmvzrztjrux6m

The Wonderful World of Global Random Oracles [chapter]

Jan Camenisch, Manu Drijvers, Tommaso Gagliardoni, Anja Lehmann, Gregory Neven
2018 Lecture Notes in Computer Science  
G sRO -functionality for the strict global random oracle.  ...  However, the traditional random-oracle model fails to guarantee security when a protocol is composed with arbitrary protocols that use the same random oracle.  ...  This work was supported by the ERC under grant PERCY (#321310) and by the EU under CHIST-ERA project USE-IT.  ... 
doi:10.1007/978-3-319-78381-9_11 fatcat:j4xggeritzhwfnsgblnjb5lkeu

Identity-based online/offline key encapsulation and encryption

Sherman S. M. Chow, Joseph K. Liu, Jianying Zhou
2011 Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security - ASIACCS '11  
In this paper, we proposed new schemes with improved efficiency over previous schemes by assuming random oracles.  ...  The knowledge of the plaintext or the receiver's identity is not required until the second phase, where the ciphertext is produced by only light computations, such as integer addition/multiplication or  ...  least · 1 q 1 where q 1 is the number of queries allowed to the random oracle H 1 and we assume q 1 = .  ... 
doi:10.1145/1966913.1966922 dblp:conf/ccs/ChowLZ11 fatcat:6ybnhb3yifcw3fhdxg47owrnuy

An Efficient Multi-PKG Online/Offline Identity-Based Encryption Scheme for Wireless Sensor Network

Jianting NING, Xinchun YIN, Yebin XU
2013 Sensors & Transducers  
The online encryption is extremely efficient and easy to be implemented on sensor node. We prove the security of our new scheme in the random oracle model.  ...  Most heavy computations such as pairing or exponentiation are done in the offline phase for pre-computation without the receiver's identity or the knowledge of the plaintext.  ...  Acknowledgements The authors would like to thank the reviewers for their detailed reviews and constructive comments, which have helped improve the quality of this paper.  ... 
doaj:5cda8e9c9c194d618e03b64476f2a718 fatcat:iqx53yzo5bfknjhvopdernop5q

The Global Power of Additional Queries toP-Random Oracles

Wolfgang Merkle
2001 SIAM journal on computing (Print)  
to any other p-random set with at most k queries.  ...  Second, we show that the separation result above can be transferred from the setting of polynomial time-bounds to a setting of rec-random sets and recursive reducibilities.  ...  We are grateful to Elvira Mayordomo for several useful corrections and suggestions, where the latter include a significant simplification of the argument in Remark 4.2 via referring to the cited result  ... 
doi:10.1137/s0097539700366711 fatcat:z67ydmay4rafpcuulq455ozngu

Page 2944 of Mathematical Reviews Vol. , Issue 95e [page]

1995 Mathematical Reviews  
power of additional queries to random oracles.  ...  reducible in k queries in any amount of time to any algorithmically random language C.  ... 

DNA self-assembled parallel computer architectures

Chris Dwyer, John Poulton, Russell Taylor, Leandra Vicci
2004 Nanotechnology  
To retain the advantages of this manufacturing scale, new architectures must efficiently use large collections of very simple circuits.  ...  New varieties of computer architectures, capable of solving highly demanding computational problems, are enabled by the large manufacturing scale expected from self-assembling circuit fabrication (10 12  ...  Like the addition oracle, the HAM-PATH oracle uses random strings of tiles to perform an assembly-time computation. The addition oracle formed all N -bit sums at assembly time.  ... 
doi:10.1088/0957-4484/15/11/055 fatcat:zusvomrutzbpffwvgwimtismza

Page 5789 of Mathematical Reviews Vol. , Issue 2001H [page]

2001 Mathematical Reviews  
{For the entire collection see MR 2001d:68024. } 2001h:68044 68Q15 03D15 Merkle, Wolfgang (D-HDBG; Heidelberg) The global power of additional queries to p-random oracles.  ...  not reducible to any other p-random set with at most k queries.  ... 

Randomization and failure detection: A hybrid approach to solve Consensus [chapter]

Marcos Kawazoe Aguilera, Sam Toueg
1996 Lecture Notes in Computer Science  
We present a Consensus algorithm that combines randomization and unreliable failure detection, two well-known techniques for solving Consensus in asynchronous systems with crash failures.  ...  In executions with no failures or failure detector mistakes, the most likely ones in practice, Consensus is reached in only two asynchronous rounds.  ...  Acknowledgement We are grateful to Vassos Hadzilacos and the anonymous referees for their valuable comments.  ... 
doi:10.1007/3-540-61769-8_3 fatcat:d4uwaa4jwbfirpg53swdyzib2y

First Order Methods take Exponential Time to Converge to Global Minimizers of Non-Convex Functions [article]

Krishna Reddy Kesari, Jean Honorio
2021 arXiv   pre-print
In this work, we provide bounds on the fundamental hardness of identifying the global minimizer of a non convex function.  ...  We show that the parameter estimation problem is equivalent to the problem of function identification in the given family.  ...  In addition, after T queries, the algorithm reconstructs a set S T from the information that it has obtained from queries to the oracle.  ... 
arXiv:2002.12911v2 fatcat:3k5orrzcqzbtxjuj33cgo4bmsy

Topological obstructions to implementing quantum if-clause [article]

Zuzana Gavorová, Matan Seidel, Yonathan Touati
2022 arXiv   pre-print
To implement this operator, one query to the oracle U suffices in linear optics, but is not enough in a quantum circuit [Araújo et al., New J. Phys., 16(9):093026, 2014].  ...  Compared to the polynomial method [Beals et al., JACM, 48(4):778-797, 2001], it excludes quantum circuits of any query complexity. Our result does not contradict process tomography.  ...  All authors thank Amitay Kamber for simplifying the proof of Lemma 1, Mateus Araújo for useful discussions, Alon Dotan and Itai Leigh for useful discussions, and an anonymous referee from the QIP conference  ... 
arXiv:2011.10031v2 fatcat:fyw4jiymbbfw7oxwj6dxcf2cx4

Privacy-Preserving Mobile Roaming Authentication with Security Proof in Global Mobility Networks

Qi Xie, Dongzhao Hong, Mengjie Bao, Na Dong, Duncan S. Wong
2014 International Journal of Distributed Sensor Networks  
The proposed scheme is more efficient and secure than other related schemes and is suitable for using in the global mobility network.  ...  Further, we prove the formal security of the proposed scheme, and present the performance comparison between our scheme and some related schemes.  ...  Otherwise, choose an element , add the record ( , ⊥, , ) to the list Λ and return . Algorithm 2: Simulation of random oracle ℎ, encryption oracle , and decryption oracle .  ... 
doi:10.1155/2014/325734 fatcat:kpe6ok6dtbe67fwpojppqzphaq

Online/Offline Identity-Based Signcryption Revisited [chapter]

Joseph K. Liu, Joonsang Baek, Jianying Zhou
2011 Lecture Notes in Computer Science  
We prove that the proposed scheme meets strong security requirements in the random oracle model, assuming the Strong Diffie-Hellman (SDH) and Bilinear Diffie-Hellman Inversion (BDHI) are computationally  ...  It is particularly suitable for power-constrained devices such as smart cards. We give a concrete implementation of online/offline identity-based signcryption.  ...  Random Oracle: For H 1 -queries (we denote ID ν the input of the ν th one of such queries), B answers I ν and increments ν.  ... 
doi:10.1007/978-3-642-21518-6_3 fatcat:pe2kn2uvsrhctp4kus7zpf3ffi
« Previous Showing results 1 — 15 out of 8,806 results